Searching Algorithms: Linear and Binary Search Algorithms with their Big O

Linear search is a search that finds an element in the list by searching the element sequentially until the element is found in the list. On the other hand, a binary search is a search that finds the middle element in the list recursively until the middle element is matched with a searched element.
Binary search is more efficient than linear search; it has a time complexity of O(log n). The list of data must be in a sorted order for it to work.