I understood the problem irrespective of one thing that in the starting …
Rotated array graph plot…there are 2 cases ohk…either the mid will be on increasing edge…or in other side of decreasing edge…
i want to know how …there are two cases for mid point…
kindly tell me using a test case…
regards
@ManasxCOdE the key concept is in a rotated sorted array, one of the array is sorted (considering two arrays from s to mid and mid+1 to e)
now we get to know which half to eliminate using this info.
say left part is sorted(from s to mid) then check whether a[s]<=target<=a[mid] if yes then search in left half else search in right half.
If you still have problem then go through the video again and then ask further.
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.