Thursday, August 11, 2011

Successful search time of BinarySearch algorithm?

Prove that the average successful search time of BinarySearch algorithm on an array of size n is Θ(log n).
Posted by Alejandra Raker at 10:02 AM

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)