Searching is the process of finding a particular element (the key) in a list or array of elements. The two most common searching techniques are linear search and binary search. Linear search checks each element one by one from the beginning until the element is found or the list ends. Binary search works only on a sorted list and repeatedly divides the list into halves to find the element much faster. The main difference is that binary search is far quicker for large sorted lists, while linear search is simpler and works on any list.
Linear search checks each element one by one from start to end.
Binary search repeatedly divides a sorted list into halves.
Linear search works on sorted and unsorted lists; binary search needs a sorted list.
Time complexity of linear search is O(n); binary search is O(log n).
Binary search is much faster than linear search for large lists.
Linear search is simpler to implement than binary search.
Binary search requires the data to be sorted first.
Linear search (also called sequential search) checks every element of the list one by one, from the first to the last, until the required element is found or the list ends.
Features: • Works on both sorted and unsorted lists. • Simple and easy to implement. • Best case: the element is at the first position — 1 comparison. • Worst case: the element is at the last position or not present — n comparisons. • Time complexity: O(n).
Example: To find 7 in [3, 5, 7, 9], it checks 3, then 5, then 7 — found at the 3rd position.
Binary search works only on a sorted list. It repeatedly compares the key with the middle element and discards half of the list each time.
Working:
Features: • Works only on a sorted list. • Much faster for large lists. • Time complexity: O(log n).
Example: To find 7 in [1, 3, 5, 7, 9], it checks the middle (5), then searches the right half and finds 7.
Linear Search: • Checks elements one by one in sequence • Works on both sorted and unsorted lists • Time complexity: O(n) • Slower for large lists • Simple to implement • No need to sort the data first
Binary Search: • Repeatedly divides the list into halves • Works only on a sorted list • Time complexity: O(log n) • Much faster for large lists • Slightly more complex to implement • Data must be sorted first
In short: linear search is simpler and works on any list, while binary search is faster but needs the list to be sorted.
Linear search checks every element one by one until the key is found; it works on any list (sorted or unsorted) and has a time complexity of O(n). Binary search works only on a sorted list and repeatedly halves the list, giving a much faster time complexity of O(log n). So linear search is simpler but slower, while binary search is faster but needs sorted data.
Binary search is faster, especially for large lists, because it eliminates half of the remaining elements at each step (time complexity O(log n)). Linear search checks elements one by one (time complexity O(n)), so it is slower for large lists. However, binary search requires the list to be sorted first.
The time complexity of linear search is O(n), where n is the number of elements, because in the worst case it checks every element. The time complexity of binary search is O(log n), because it halves the search space at each step.
Binary search compares the key with the middle element and decides whether to search the left or right half. This decision is only correct if the list is sorted, because then all elements on one side are smaller and on the other side are larger. If the list is unsorted, halving it would not reliably narrow down the position, so binary search cannot be used.
Second Generation of Computers (1956–1963)
Learn about the second generation of computers (1956-1963). Transistors replaced vacuum tubes, making computers smaller, faster and more reliable.
Convert 3.5 cm x 4.5 cm to Pixels
Learn how to convert the standard passport photo size of 3.5 cm x 4.5 cm into pixels at 300 DPI for online application forms.
How to Convert 6 cm to Pixels?
Find out how many pixels are in 6 centimeters. Learn the formula using different DPI resolutions like 72, 96, and 300 for print and web design.
What is Abstraction in Java? OOP Concepts Explained
Learn what Abstraction is in Java. Understand this core OOP concept, how to use abstract classes and interfaces, and why it's crucial for hiding implementation details.
What Does a Computer Consist of? — Components Explained
Learn what a computer consists of. CPU, input devices, output devices, memory, and storage — all basic computer components explained for Class 6 to 10.
Turn this guide into revision flashcards, a practice exam, or an AI-generated podcast — free, no signup required.