medium10 pts · first answer countsarraysbinary-search
Minimum of a rotated sorted array
To find the minimum of [4, 5, 6, 7, 0, 1, 2] in O(log n), which comparison decides the side?
Discussion 0
Join free to post in the discussion.
Related questions
- Cost of reading arr[i]Backend Developer
- Inserting at the front of an arrayBackend Developer
- Why push is amortized O(1)Backend Developer
- Changing one character of a stringBackend Developer
- Reversing a simple stringBackend Developer
- slice vs spliceBackend Developer
- Index of the last elementBackend Developer
- indexOf and NaNBackend Developer