Decomposed Algorithm for Reducing Time Complexity in Binary Search

Abstract

Searching is one of the principal tasks in computer science. Binary Search is one of the most common and efficient algorithms used. Binary Search targets the middle element and checks for the target key in the list. The worstcase Time Complexity of Binary Search is O(log(n)) where n less length of the search list. In this paper, we have proposed a fast and efficient approach to binary Search by decomposing the main search list into multiple search lists. The Time Complexity for the proposed algorithm is O(log(k)) where k < n and n is the length of the sorted list and k is the length of the sub-list.