Suppose a sorted array is rotated at some pivot unknown to you. For example, [0 1 2 4 5 6 7] might become [5 6 7 0 1 2 4].
Given a rotated array, find out if it was originally sorted. Your function will return true for this array: [4 5 6 7 0 1 2]. But it will return false for [2 5 6 8 0 1 3], because its original array, i.e., [0 1 3 2 5 6 8], was not sorted.
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers80
Suggested Problems
-
Project Euler: Problem 7, Nth prime
1778 Solvers
-
Count consecutive 0's in between values of 1
541 Solvers
-
512 Solvers
-
07 - Common functions and indexing 1
455 Solvers
-
529 Solvers
More from this Author3
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Additional test cases have been added.