Min in a circular list

By -
You are given a list of numbers. When you reach the end of the list you will come back to the beginning of the list (a circular list). Write the most efficient algorithm to find the minimum # in this list. Find any given # in the list. The numbers in the list are always increasing but you don’t know where the circular list begins

Comments

  1. MavrikNovember 25, 2010 at 2:35 PM

    continue till you find that the next number is smaller than your current number. The next number is the smallest and the current is the largest. :)

    ReplyDelete
  2. AdminNovember 25, 2010 at 5:39 PM

    @mavrik yeah true..

    ReplyDelete

Post a Comment

Popular posts from this blog

By -
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples: Input: n = 5 Output: 1 Factorial of 5 is 20 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24
Read more