Skip to main content
/Searching/Binary Search
1 / 7
Speed
ENES
/
Big O NotationRecursionTwo PointersSliding WindowSpace ComplexityMemoizationGreedy vs DP
StackQueueLinked ListHash TableBinary Search TreeHeap
Bubble SortSelection SortInsertion SortQuick SortMerge SortHeap SortCounting SortRadix SortShell Sort
Binary SearchLinear SearchJump SearchInterpolation Search
Breadth-First SearchDepth-First SearchDijkstra's AlgorithmPrim's AlgorithmTopological Sort
Fibonacci DPKnapsack 0/1Longest Common Subsequence
N-Queens ProblemSudoku SolverMaze Pathfinding
Tower of Hanoi
38 algorithms·by midudev
2
5
8
12
16
23
38
56
72
91
0
1
2
3
4
5
6
7
8
9
Step 1:Sorted array. Searching for target: 23
Variables
target==23
low==0
high==9