Question

I m getting stucked with this algorithmic complexity.im not get the log n of a thing. Any help

Answer 1

do you know what a logarithm is?

http://en.wikipedia.org/wiki/Time_complexity#Table_of_common_time_complexities

Answer 2

When you do binary search for an array of n nos then you execute the loops a maximum of "log n" times, i.e. the program takes maximum of "log n" nos of steps to execute.. it may even take less nos of steps to finish, "log n" nos of steps being the worst case scenario..