ODD EVEN BASED BINARY SEARCH

Searching is one of the important operations in computer science. Retrieving information from huge databases takes a lot of processing time to get the results. The user has to wait till the completion of processing to find whether search is successful or not. In this research paper, it provides a detailed study of Binary Search and how the time complexity of Binary Search can be reduced by using Odd Even Based Binary Search Algorithm, which is an extension of classical binary search strategy. The worst case time complexity of Binary Search can be reduced from O(log2N) to O(log2(N-M)) where N is total number of items in the list and M is total number of even numbers if search KEY is ODD or M is total number of odd numbers if search KEY is EVEN. Whenever the search KEY is given, first the KEY is determined whether it is odd or even. If given KEY is odd, then only odd numbers from the list are searched by completely ignoring list of even numbers. If given KEY is even, then only even numbers from the list are searched by completely ignoring list of odd numbers. The output of Odd Even Based algorithm is given as an input to Binary Search algorithm. Using Odd Even Based Binary Search algorithm, the worst case performances in Binary Search algorithm are converted into best case or average case performance. Therefore, it reduces total number of comparisons, time complexity and usage of various computer resources.