{'fraction_non_alphanumeric': 0.015306122448979591, 'fraction_numerical': 0.002551020408163265, 'mean_word_length': 4.865671641791045, '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}}
Average case analysis when merging two ordered lists of different length

A derivation for the expected number of comparisons when merging two ordered lists is given, where the sizes of the individual lists are unknown but the size of the merged list is known. Other applications where this result can be applied are also mentioned, most notably the LUPSort algorithm of Merritt and Nauck[4].