Did not understand the code

#1

Help me s i can understand the algo of this problem

#2

You have to start the same way as you do for binary search i.e. find the middle element.
After that, all you have to do is to check whether array at the left side or the right side of the middle element is sorted.
for left side: a[s]<a[mid]
for right side: a[mid]<a[e]
Once you have found the sorted side, just check if the element is present in the sorted:
if it present then continue for that sorted part of the array
else continue for the unsorted part.
To check if an element is present in the sorted part:
left part is sorted: a[s] <= key and key > a[m]
right part is sorted: a[mid] < key and key >= a[e]

Using the above criteria and binary search methodology in O(log N) time

Find middle point mid = (l + h)/2
If key is present at middle point, return mid.
Else If arr[l…mid] is sorted
a) If key to be searched lies in range from arr[l]
to arr[mid], recur for arr[l…mid].
b) Else recur for arr[mid+1…h]
Else (arr[mid+1…h] must be sorted)
a) If key to be searched lies in range from arr[mid+1]
to arr[h], recur for arr[mid+1…h].
b) Else recur for arr[l…mid]

Hope, this would help.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.