The linear search is the basic searching algorithm to search an item among the set of different items. Second basic algorithm is binary search that performs better than linear search. both are unstable sorting algorithms. Today many searching algorithm are present that are very fast to search an item. In this paper, a new approach for searching an item is presented. The comparison of proposed algorithm with Linear, Binary is also shown. The use of C++ for the implementation of this algorithm and analysis of CPU time taken by both is also preferred. Results have shown that proposed algorithm is working well for all the input values and it takes lesser time than sequential, binary searching in all aspects.

Keywords : Binary search, Linear Search, Layer Search, Searching techniques, Time Complexity, unstable searching algorithm.