Binary Search is used to find a key number from a list of numbers. The time complexity of the algorithm is O(nlog n). The advantage is the shorter time requirement and the disadvantage is that Linear Search works only with a sorted list of numbers. So Linear Search is a not a general search algorithm which can be applied on any list.
- The Algorithm takes only O(n log n) time for finding the item.
- Gives the correct output only if the array of numbers is sorted.