Bitonic Array Search
Bitonic Array Search Bitonic array search finds a target in an array that strictly increases up to a peak and then strictly decreases. Such an array is called bitonic. Example: $$ [1, 3, 8, 12, 9, 5, 2] $$ The array increases to a maximum at index $3$, then decreases. Problem Given a bitonic array $A$ of length $n$ and a value $x$, find an index $i$ such that $$...