Searching — Chapter Summary

Searching is the process of locating

Searching is the process of locating a particular element in a collection. It tells whether the element is present and, if present, where it is locate

Linear search compares each element

Linear search compares each element of a list one by one with the key until a match is found or the full list is checked. It is also called sequential

Binary search works on a sorted

Binary search works on a sorted list. It compares the key with the middle element and then continues in only the first half or second half depending o

The middle index is found using

The middle index is found using mid = (first+last)//2. For an even number of elements, floor division is used.

A hash function calculates the index

A hash function calculates the index at which an element should be placed in a hash table. For numeric values, the remainder method uses h(element) =