anonymous
  • anonymous
I m getting stucked with this algorithmic complexity.im not get the log n of a thing. Any help
MIT 6.00 Intro Computer Science (OCW)
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
schrodinger
  • schrodinger
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
do you know what a logarithm is? http://en.wikipedia.org/wiki/Time_complexity#Table_of_common_time_complexities
anonymous
  • anonymous
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..

Looking for something else?

Not the answer you are looking for? Search for more explanations.