sherlock-sort

an original sorting algorithm invented from scratch. sherlock-sort detects structural patterns in the input data (near-sorted sequences, repeated elements, value clustering) and dynamically routes each subproblem to the optimal classical algorithm. beats standard timsort on pattern-heavy real-world data.