Next:
Proof: (Binary search is
Up:
Optimality of Binary Search
Previous:
To Show:
Descision Trees
Sequential Search
n
=16
W
(
n
)=
n
Jump Search
n
=16 sublist size
Binary Search
Middle
Proof: (Binary search is optimal)
Sushil Prasad
Thu May 13 13:13:06 EDT 1999
