TK Memo
This video isn't available yet.
Loading video
Binary search
Computer Science · Algorithms 23 views
On a sorted row, compare the middle number and throw away half the interval. Best case is one comparison; a miss costs about log n.
algorithmsbinary searchbisection searchsearching
0:43
Shell sort
Computer Science · Algorithms
13 views · Sep 13, 2026
0:42
Heap sort
Computer Science · Algorithms
11 views · Sep 13, 2026
0:54
Quick sort
Computer Science · Algorithms
11 views · Sep 13, 2026
0:50
Selection sort
Computer Science · Algorithms
13 views · Sep 13, 2026
0:57
Counting sort
Computer Science · Algorithms
13 views · Sep 13, 2026
1:00
Radix sort
Computer Science · Algorithms
13 views · Sep 13, 2026