Next:
SEARCHING ON A SORTED
rotate
SEARCHING ON A SORTED LIST
Jump Search
Jump Search (Divide and Conquer:)
Recursively apply partitioning in a smaller list
RECURSIVE JUMP SEARCH: With Best Value for
k
Binary Search:
Optimality of Binary Search
Computation Model:
To Show:
Descision Trees
Proof: (Binary search is optimal)
About this document ...
Sushil Prasad
Thu May 13 13:13:06 EDT 1999