Back

Sunday common C++ interview problem: Minimum in a rotated array.

Given an array of unique integers (std::vector<int>) that has been sorted in ascending order and then rotated by an unknown number of elements, return the minimum value in the array in O(logn).

Solve it yourself: https://compiler-explorer.com/z/7oYchz8Ed
Solution: https://compiler-explorer.com/z/YrYhcbKzT