hard20 pts · first answer countssorting-and-searching
Search in a bitonic array
An array first strictly increases and then strictly decreases, such as [1, 4, 9, 12, 7, 3]. How can you find a given value in O(log n)?
Discussion 0
Join free to post in the discussion.
Related questions
- Bubble sort best case with early exitBackend Developer
- What a stable sort meansBackend Developer
- Merge sort time in every caseBackend Developer
- Best simple sort for nearly sorted dataBackend Developer
- Swaps made by selection sortBackend Developer
- What in-place sorting meansBackend Developer
- Quick sort worst-case timeBackend Developer
- JavaScript default sort on numbersBackend Developer