Educator

Searching

• Searching a list is a common operation to locate a value in a list.

• Sequential search is a search that starts examining values in the list from the beginning of the list and keeps on doing it till the item is located or the end of the list is reached and item not found. Sequential search works on sorted or unsorted list.

• Binary search is used on a sorted list to find location of a value in the list. It is much faster especially when the list is large.

• Hash search is used when data is stored in a hash table with unique keys and since each value in the list has a unique address it is much faster than both binary and sequential search.