01. Searching and Sorting

Searching and sorting techniques spanning sequential and parallel algorithms, from linear scan to GPU-based distribution sort.

12 items

Searching and Sorting

This 350 page list is usable as the final page inventory for Searching and Sorting.

Total check:

category	count	range
Linear and sequential search	20	1-20
Binary search and ordered search	35	21-55
Hashing and table search	25	56-80
Tree and indexed search	35	81-115
Selection and order statistics	35	116-150
Elementary sorting	30	151-180
Divide and conquer sorting	35	181-215
Integer and distribution sorting	40	216-255
Partial, online, and adaptive sorting	30	256-285
External memory, cache, and database sorting	25	286-310
Parallel, distributed, and GPU sorting	25	311-335
Specialized search and sorted-order procedures	15	336-350

Wiki › Algorithms › 01. Searching and Sorting ›

1. Linear and Sequential Search

Linear and sequential scan techniques including sentinel, bounded, recursive variants, duplicate detection, and majority vote.

Wiki › Algorithms › 01. Searching and Sorting ›

2. Binary Search and Ordered Search

Binary search and its ordered-search relatives: interpolation, Fibonacci, rotated-array, matrix, parametric, and offline variants.

Wiki › Algorithms › 01. Searching and Sorting ›

3. Hashing and Table Search

Hash table lookup strategies, open-addressing and chaining variants, probabilistic filters (Bloom, Cuckoo, XOR), and locality-sensitive similarity search.

Wiki › Algorithms › 01. Searching and Sorting ›

4. Tree and Indexed Search

Tree-based and indexed search: BST, self-balancing trees, tries, suffix structures, segment and range trees, and spatial trees.

Wiki › Algorithms › 01. Searching and Sorting ›

5. Selection and Order Statistics

Selection and order-statistics: quickselect, median-of-medians, streaming top-k, heavy hitters, reservoir sampling, and quantile summaries.

Wiki › Algorithms › 01. Searching and Sorting ›

6. Elementary Sorting

Elementary comparison-based sorts: bubble, selection, insertion, Shell, comb, cycle, and curiosity sorts.

Wiki › Algorithms › 01. Searching and Sorting ›

7. Divide and Conquer Sorting

Divide-and-conquer sorts: merge sort variants, quicksort family, heapsort, and comparison-based sorting networks.

Wiki › Algorithms › 01. Searching and Sorting ›

8. Integer and Distribution Sorting

Non-comparison sorts: counting, radix, and bucket sort families, string sorting, and suffix array construction.

Wiki › Algorithms › 01. Searching and Sorting ›

9. Partial, Online, and Adaptive Sorting

Sorting under constraints: partial sort, online insertion, adaptive merge, Timsort internals, and lazy or order-maintenance sorting.

Wiki › Algorithms › 01. Searching and Sorting ›

10. External Memory, Cache, and Database Sorting

Sorting beyond main memory: external merge sort, polyphase merge, cache-oblivious techniques, LSM compaction, and database sort phases.

Wiki › Algorithms › 01. Searching and Sorting ›

11. Parallel, Distributed, and GPU Sorting

High-throughput sorting: parallel merge and quicksort, GPU bitonic and radix sort, SIMD sorting networks, and distributed partition-based sorts.

Wiki › Algorithms › 01. Searching and Sorting ›

12. Specialized Search and Sorted-Order Procedures

Cache-efficient and hardware-tuned search: branchless binary search, Eytzinger and vEB layouts, learned indexes, SIMD search, and galloping intersection.