6.8. Summary¶

• A sequential search is \(O(n)\) for ordered and unordered lists.
• A binary search of an ordered list is \(O(\log n)\) in the worst case.
• Hash tables can provide constant time searching.