Data Structures
Find Minimum in Rotated Sorted Array
Find Minimum in Rotated Sorted Array (LeetCode 153): binary search comparing mid with the right end, in O(log n).
#Rotated Array
3 notes tagged
Data Structures
Search in Rotated Sorted Array II (With Duplicates)
Search in Rotated Sorted Array II (LeetCode 81) with duplicates: binary search that shrinks ambiguous ends, O(log n) average and O(n) worst case.
Data Structures
Search in Rotated Sorted Array
Search in Rotated Sorted Array (LeetCode 33): modified binary search that identifies the sorted half each step, in O(log n).