skip to main | skip to sidebar

The joy of Building !!!

Friday, March 6, 2009

4. Position of a number in a sorted array

4. How many comparisons are required to find the position of a number in a sorted array.

Answer: Using binary search it would require O(log n) comparisons.
Posted by rogue at 10:34 AM 1 comment:
Labels: Algorithms, array, Datastructures, puzzles
Newer Posts Older Posts Home
Subscribe to: Posts (Atom)

Blog Archive

  • ►  2015 (1)
    • ►  October (1)
  • ►  2012 (1)
    • ►  September (1)
  • ▼  2009 (8)
    • ►  September (1)
    • ►  August (1)
    • ▼  March (1)
      • 4. Position of a number in a sorted array
    • ►  February (3)
    • ►  January (2)
  • ►  2008 (7)
    • ►  December (1)
    • ►  November (3)
    • ►  July (2)
    • ►  February (1)

About Me

My photo
rogue
View my complete profile