GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
200 views
Consider an array ‘A’ with 2m elements. The elements in odd position are sorted in non-increasing order that is A[1] >= A[3] >= A[5]......A[2m-1] The elements in even position are sorted in non-decreasing order, that is A[2]<= A[4] <= A[6].....A[2m]. Which of the following method is recommended for finding if a given number is in array?
asked in Algorithms by Boss (5.4k points)   | 200 views

1 Answer

+5 votes
Best answer

The proper way to do is :

a) Implement binary search by a little modification in finding the middle index for both the 2 same sized subarrays..

b) If found , then report the element else continue recursively..

So the time complexity will be O(logm + logm)  = O(2logm) = O(logm) 

answered by Veteran (59.7k points)  
selected by
Yes, also in iterative version of binary search, we need to we need to increase (or) decrease index of mid by factor of $2$
What would be the space complexity if we will apply binary search on odd indices and even indices separately?
space complexity is still O(m) exact i can say 2m +m(store half) +m(store half) = 4m
To find space complexity of recursive procedure , we consider the height of the corresponding recursion tree..As the recursion tree of binary search will contain O(logn) levels whatever the case may be so the space complexity due to function call will be : O( logn)
(logn) is extra space right ?
Yup space required for function call overhead
Top Users Jan 2017
  1. Debashish Deka

    8968 Points

  2. sudsho

    5326 Points

  3. Habibkhan

    4798 Points

  4. Bikram

    4532 Points

  5. Vijay Thakur

    4486 Points

  6. saurabh rai

    4222 Points

  7. Arjun

    4196 Points

  8. santhoshdevulapally

    3808 Points

  9. Sushant Gokhale

    3596 Points

  10. Kapil

    3486 Points

Monthly Topper: Rs. 500 gift card

19,212 questions
24,104 answers
53,151 comments
20,319 users