{'fraction_non_alphanumeric': 0.03494623655913978, 'fraction_numerical': 0.004032258064516129, 'mean_word_length': 5.208333333333333, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
The Spreadsort High-performance General-case Sorting Algorithm

A high-performance nearly in-place general-case sorting algorithm named SpreadSort is demonstrated. It is approximately 4X as fast as Quicksort in normal cases, and up to 18X as fast with distributions of limited variation (much like Bucketsort). The technique is mixed distributional and comparison-based, merging many of the advantages of both techniques. Spreadsort can operate recursively, but is O(n) for continuous integrable functions, and has better than O(nlog(n)) worst-case performance when used with distributions where the keys have finite length, so recursion past the second iteration is rare. This algorithm can be modified to be in-place with a modest speed loss.