Hashing
In the previous two sections, we explored two groups of search algorithms: those with linear time complexity and those with more efficient, sub-linear time complexity. Linear search algorithms, such as the simple sequential search, operate with 
time complexity, making them straightforward but less efficient for large datasets. On the other hand, sub-linear search algorithms, such as binary search and jump search, offer significantly better time complexities, often 
or 
, by leveraging the properties of sorted data to minimize the number of comparisons needed.
However, achieving this improved time complexity comes with a cost: the time required to sort the data. Sorting is a prerequisite for the efficiency of sub-linear search algorithms. Without sorted data, the theoretical benefits of sub-linear time complexity cannot be realized. The process of sorting itself can be time-consuming, typically 
for efficient algorithms such as quick sort or merge sort. Therefore, while sub...
