role-algorithms:sorting-and-searching

Choosing the best sorting algorithm depends on data characteristics like size, distribution, and key type. Comparison sorts like quicksort handle general data, while non-comparison sorts like radix or counting excel with specific key distributions.

To find the k-th smallest element, use the quickselect algorithm for average O(n) time complexity. Alternatively, streaming median techniques handle order statistics efficiently on continuous data flows.

The best way to search for multiple string patterns simultaneously is using the Aho-Corasick algorithm. It builds an automaton for efficient multi-pattern matching, quickly locating all occurrences of target error patterns.

External merge sort handles datasets exceeding available memory by dividing data into manageable chunks, sorting each chunk individually, and then merging the sorted chunks using disk-based operations.

Use lower and upper bound binary search variants when finding insertion points or range boundaries in sorted data. Answer-space binary search applies when searching monotonic functions rather than discrete values.