role-algorithms:sorting-and-searching

What problem does it solve?

This Skill provides implementations and guidance for a wide array of sorting and searching algorithms, enabling efficient data organization and retrieval.

Core Features & Use Cases

• Algorithm Selection: Choose the optimal sorting algorithm (comparison-based or non-comparison-based) based on data characteristics like size, distribution, and key type.
• Efficient Searching: Implement various binary search techniques (standard, lower/upper bound, answer-space) and order statistics (quickselect, streaming median).
• String Matching: Utilize algorithms like KMP, Boyer-Moore, and Aho-Corasick for single and multi-pattern string searching.
• External Sorting: Handle datasets that exceed available memory using external merge sort strategies.
• Use Case: Optimize a database query by implementing an efficient binary search for finding records within a sorted index, or process large log files to find all occurrences of specific error patterns using Aho-Corasick.

Quick Start

Use the sorting and searching skill to find the k-th smallest element in a list of numbers.