Ternary search algorithm: Improvement of binary search

The empirical calculation is displayed in this paper for searching which is an improvement of binary search. On the off chance that we don´t have any data on how the numbers are sorted out in the array, we need to consecutively analyze every component of the array; it is called as linear search with time complexity O(n).However, if the elements of the array are sorted, given us a chance to say in ascending order, and we wish to locate position of a number target K in the array, we require not make a successive search over the complete array. Therefore we propose the method known as ternary search in order to quickly search the required element. We have additionally turned out to be more viable and effective calculation as contrasted with the binary search as the time complexity of the new proposed calculation lessens to O (log₃n).