Blog: If there are 2^(n+1) elements in an array then what would be the number of iterations required to search a number using binary search algorithm?

Wednesday 1 December 2010

If there are 2^(n+1) elements in an array then what would be the number of iterations required to search a number using binary search algorithm?

► n elements
► (n+1) elements
► 2(n+1) elements
► 2^(n+1)elements

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)