Help rahul pivot element -binary search

#1

what if he gave input like 4,2,1,5,3 then code given in video will it works?

#2

no this logic only works for a sorted array which is rotated

#3

sir what if we sort array again and then apply binary search? was there nay restriction on sorting the array again

#4

If you sort the array you will lose the original position of the elements. So your answer will be wrong

#5

can’t we use linear search here? that will only n repeptitions and simple aslo

#6

Time complexity of linear search -O(n) , Binary search has time complexity O(log n). but linear search will give you the answer too