Please enable JavaScript.
Coggle requires JavaScript to display documents.
Search (on sorted input (binary (Search by repeatedly dividing the searchโฆ
Search
on sorted input
-
jump
The optimal size of a block to be jumped is (โ n). This makes the time complexity of Jump Search O(โ n).
-
Binary Search is better than Jump Search, but Jump search has an advantage that we traverse back only once (Binary Search may require up to O(Log n) jumps, consider a situation where the element to be searched is the smallest element or smaller than the smallest)
-
Interpolation search
-
-
Binary Search always goes to the middle element to check. On the other hand, interpolation search may go to different locations according to the value of the key being searched
-
-
on unsorted input
linear
O(n) time, constant space
-