tag

#rotated-array

2 pages tagged

Wiki › Algorithms › 01. Searching and Sorting › 2. Binary Search and Ordered Search ›

Rotated Array Search

Rotated Array Search Rotated array search finds a target value in an array that was originally sorted, then rotated around some pivot. The array still contains two sorted regions, but the smallest element may no longer be at index $0$. For example: $$ [1, 3, 5, 7, 9, 11] $$ may become: $$ [7, 9, 11, 1, 3, 5] $$ The goal is to keep logarithmic search time without first...

Wiki › Algorithms › 01. Searching and Sorting › 2. Binary Search and Ordered Search ›

Rotated Array Minimum Search

Rotated Array Minimum Search Rotated array minimum search finds the smallest element in a sorted array that has been rotated around an unknown pivot. For example: $$ [1, 3, 5, 7, 9] $$ may become: $$ [7, 9, 1, 3, 5] $$ The minimum element is the rotation point. Problem Given a rotated sorted array $A$ of length $n$, find an index $i$ such that $$ A[i] = \min(A) $$...