# Searching and Hashing

## 6. Summary

A sequential search is

- for ordered and unordered lists.
- A binary search of an ordered list is
- in the worst case.
- Hash tables can provide constant time searching.

A sequential search is

- for ordered and unordered lists.
- A binary search of an ordered list is
- in the worst case.
- Hash tables can provide constant time searching.