{'fraction_non_alphanumeric': 0.025896414342629483, 'fraction_numerical': 0.00199203187250996, 'mean_word_length': 4.781609195402299, '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}}
Unexpected speed-up in Java on multiprocessors

Fine-tuning the partitioning algorithm for Quick Sort and Kth Element led to investigation of alternative ways of moving the median of three elements into position for the algorithm as used by Naps [1]. One is to fully three-sort the low, middle, and high elements; the other, simply to identify the median element and move it into the low position. Unexpectedly, the latter algorithm takes more time when running under Java on a multiprocessor computer.