Optimizing Time Complexity of Searching Operation: A Noble Algorithm

Abstract

By the passage of time , there are many searching algorithm and data structure evolved to make basic operations more efficient with respect to time and space complexity like storing, searching, deleting the data and they play very important role in real-world applications. Based on mechanism of searching, Searching algorithm can be classified into three types of algorithm: linear, binary, hashing, but excluding these, there are many searching techniques proposed by many researchers. The aim of all these proposed searching technique is to optimize the time complexity of searching operation generally compared to Binary Search, which have average and worst case time complexity of log(n), where n is number of elements. This paper proposes a noble searching algorithm that works for sorted array data structure and performs better in most of the cases than that of binary search. The proposed searching Technique will either find index of target element or find a small space within array space by using statistical operation, and then binary search will be applied to that small space, thus it will reduce the overall time complexity. This paper briefly discusses, proposed algorithm and it’s time complexity and comparing the efficiency of the algorithm with some of the well-known other algorithms, using graphs and tables and its practical applications. We will analyze the behavior of algorithm in different parameters like:-size of input data, Nature of elements in list, Different Case Scenario (worst, best, and avg. case) etc.