interesting problem: you have an unsorted array of N positive numbers. You have to find out atleast one number that is > the median number in the array with complexity better than O(1/2n) . e.g array of 1-10 numbers, median number is 5, so acceptable number is 6+