Category Searching Algorithms

Binary Search

Binary search is the most popular and efficient searching algorithm having an average time complexity of O(log N). Like linear search, it is used to find the position of a particular item in the list.

Linear Search

Linear search is used to find a particular element in a list or collection of items. Target element is compared sequentially with each element of a collection until it is found. Otherwise it will traverse through that list until it reaches to the end of the list.