Minimum Element in a Sorted & Rotated Array | DSA | Programming Tutorials | GeeksforGeeks

Our courses :

This video is contributed by Rahul Singla

Please Like, Comment, and Share the Video among your friends.

Install our Android App:

If you wish, translate into the local language and help us reach millions of other geeks:

Follow us on Facebook:

And Twitter:

Also, Subscribe if you haven't already! :)

[jaiho]

But it will take O(n) time in duplicates . Then, how it is in O(logn) ??

[yutaitadori]

Is this solution considering duplicate elements?

[deveshjoshi]

This is not the proper explanation
1) Edge cases were not explained
2) what if in some case mid-1 does not exist similarly in some case mid+1 does not exist
3) Proper reason not given for duplicate values.
This video needs to be improved.

[ithilak]

Very good explanation . But 5 4 3 2 1 is a wrong example (it is not a Rotated sorted Array)

[sachinshetti]

Good explaination sir, BUT
we cant find minimum value of reverse array ( i.e {5, 4, 3, 2, 1})

[vishnuvardhanreddy]

When mid = 0 what will be arr[mid - 1]?

[sabhyasachini]

needed much better person to explain this question . he couldnt explain it properly . seems he is confused and doing anything

[lakshmikandhi]

Plzz resume guess the output series.. they are more useful than this