Search an element in a bitonic array in O(log n)
Filed under Hike
The question
Given a bitonic array that first increases and then decreases, search for a given target element in O(log n) time. Extend this to general variations (ascending, descending, increasing-then-decreasing, decreasing-then-increasing) and handle duplicates.
No write-up yet. Related questions below have one.
Related Hike questions
Collected from public candidate posts and coding forums. Updated Nov 2026.