A novel approach for searching an element in a sorted array - log search

In computer science, various searching algorithms are available. We choose among them according to the situation. There are some efficient searching algorithms like Binary Search, Jump Search etc. In this paper a new searching algorithm which tracks the key element faster in some cases is proposed. This algorithm is Log Search. This algorithm only works for a sorted array. This algorithm searches the key element in a sub-array of the full array. If there is no possibility to find the key element, it will try to find out the next sub-array. If there is a possibility to find it to that sub-array, then it will recursively do the same thing.