{'fraction_non_alphanumeric': 0.01330603889457523, 'fraction_numerical': 0.0, 'mean_word_length': 4.686046511627907, '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}}
KLP's Search Algorithm - A New Approach to Reduce the Average Search Time in Binary Search

There are various issues in different fields of Computers, Database Management Systems, Networks, Data Mining, and Artificial intelligence. But, the common problem in any field is searching for an element from a large amount of data. There are numerous techniques for searching element of which most commonly used technique is Binary search where the comparison is done by dividing the entire n elements into half in each iteration and matching with the key. The main objective of this paper is to reduce the expected number of comparisons during the search process. Here this paper presents a new algorithm which reduces the average number of comparisons required to search an element based on the size of the element. It is clearly shown in this paper that by considering only elements whose size is equal to the size of key reduces the number of steps required to search an element.