Pivot of sorted and rotated array

#1

i have confusion about statement of question
can I elaborate the question
what can I do

#2

@khemchandrs
You have to take n and all n elements of array as input from user .pivot element means that the array was sorted then it was rotated (some elements picked from the end and appended to the front)use modified binary search to find pivot element :

  1. If array[0] <= array[length of array - 1], it means the array is not rotated, so return 0.
  2. Initialize start = 0, end = length of array - 1.
  3. Repeat following steps till start <= end
    a). Set mid = (start+end)/2.
    b). If mid+1 is pivot, then break.
    c). If array[start] <= array[mid], it means from start to mid, all elements are in sorted order.
    Set start = mid+1, so that we look for pivot in second half of the array.
    d). Else set end = mid-1, to look for pivot in first half.