{'fraction_non_alphanumeric': 0.008849557522123894, 'fraction_numerical': 0.0058997050147492625, 'mean_word_length': 5.172727272727273, '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}}
QuickSort A Historical Perspective and Empirical Study

In this paper a comprehensive survey and empirical study of the Quicksort algorithm is provided. The survey examines in detail all the different variations of Quicksort starting with the original version developed by Hoare in 1961 and ending with some of the most recent ones. The paper also investigates some new sorting algorithms and compares their performances to the various versions of Quicksort. The study compared each algorithm in terms of the number of comparisons performed and the running times when used for sorting arrays of integers that were already sorted, sorted in reverse order, and generated randomly.