Binary Search vs Linear Search Real Cost Difference in DSA C++ - Visual Comparison

Concept Flow - Binary Search vs Linear Search Real Cost Difference

Start at index 0

↓

Check element == target?

No→Move to next index

↓

Index < array size?

No→Not found

↓

Found element

↓

Repeat check

↓

Start with low=0, high=n-1

↓

Calculate mid = (low+high)/2

↓

Check element at mid == target?

↓

Found

↓

high = mid-1

↓

low <= high?

No→Not found

Linear search checks each element one by one until it finds the target or ends. Binary search repeatedly splits the sorted array in half to find the target faster.

Execution Sample

DSA C++

int linearSearch(int arr[], int n, int target) {
  for (int i = 0; i < n; i++) {
    if (arr[i] == target) return i;
  }
  return -1;
}

int binarySearch(int arr[], int n, int target) {
  int low = 0, high = n - 1;
  while (low <= high) {
    int mid = low + (high - low) / 2;
    if (arr[mid] == target) return mid;
    else if (arr[mid] < target) low = mid + 1;
    else high = mid - 1;
  }
  return -1;
}

Linear search scans each element until it finds the target. Binary search divides the sorted array to find the target faster.

Execution Table

Step	Operation	Index Checked / Mid	Condition	Action	Visual State
1	Linear Search start	Index=0	arr[0] == 7?	No, move to next	[3, 5, 7, 9, 11]
2	Linear Search	Index=1	arr[1] == 7?	No, move to next	[3, 5, 7, 9, 11]
3	Linear Search	Index=2	arr[2] == 7?	Yes, found target	[3, 5, 7, 9, 11]
4	Binary Search start	low=0, high=4	Calculate mid=2	Check arr[2] == 7?	[3, 5, 7, 9, 11]
5	Binary Search	mid=2	arr[2] == 7?	Yes, found target	[3, 5, 7, 9, 11]
6	Linear Search start	Index=0	arr[0] == 12?	No, move to next	[3, 5, 7, 9, 11]
7	Linear Search	Index=1	arr[1] == 12?	No, move to next	[3, 5, 7, 9, 11]
8	Linear Search	Index=2	arr[2] == 12?	No, move to next	[3, 5, 7, 9, 11]
9	Linear Search	Index=3	arr[3] == 12?	No, move to next	[3, 5, 7, 9, 11]
10	Linear Search	Index=4	arr[4] == 12?	No, move to next	[3, 5, 7, 9, 11]
11	Linear Search end	Index=5	Index >= n?	Target not found	[3, 5, 7, 9, 11]
12	Binary Search start	low=0, high=4	Calculate mid=2	Check arr[2] == 12?	[3, 5, 7, 9, 11]
13	Binary Search	mid=2	arr[2] < 12?	Yes, low = mid+1 = 3	[3, 5, 7, 9, 11]
14	Binary Search	low=3, high=4	Calculate mid=3	Check arr[3] == 12?	[3, 5, 7, 9, 11]
15	Binary Search	mid=3	arr[3] < 12?	Yes, low = mid+1 = 4	[3, 5, 7, 9, 11]
16	Binary Search	low=4, high=4	Calculate mid=4	Check arr[4] == 12?	[3, 5, 7, 9, 11]
17	Binary Search	mid=4	arr[4] == 12?	No, arr[4] < 12? Yes, low = mid+1 = 5	[3, 5, 7, 9, 11]
18	Binary Search	low=5, high=4	low <= high?	No, target not found	[3, 5, 7, 9, 11]

💡 Linear search stops after checking all elements or finding target; binary search stops when low > high or target found.

Variable Tracker

Variable	Start	After Step 3	After Step 5	After Step 11	After Step 18
Linear Search index	0	2 (found target)	2	5 (end, not found)	5
Binary Search low	0	0	0	0	5
Binary Search high	4	4	4	4	4
Binary Search mid	2	2 (found target)	2	2	4

Key Moments - 3 Insights

Why does binary search calculate mid as (low + high) / 2 instead of just picking a random index?

Binary search splits the search range in half each time to reduce search space efficiently. The mid calculation (low + high) / 2 finds the middle index to check, as shown in execution_table steps 4, 12, 14, and 16.

Why does linear search sometimes take more steps than binary search?

Linear search checks each element one by one until it finds the target or ends, so it can take up to n steps. Binary search cuts the search space in half each time, so it usually finds the target faster, as seen comparing steps 1-3 (linear) vs 4-5 (binary).

Why does binary search stop when low > high?

When low becomes greater than high, it means the target is not in the array because the search space is empty. This is shown in execution_table step 18 where low=5 and high=4, so binary search ends without finding the target.

Visual Quiz - 3 Questions

Look at the execution_table, what is the value of 'mid' at step 14 during binary search?

A 4

B 2

C 3

D 1

💡 Hint

Check the 'Index Checked / Mid' column at step 14 in execution_table.

At which step does linear search conclude the target 12 is not found?

A Step 10

B Step 11

C Step 9

D Step 12

💡 Hint

Look for the step where linear search index reaches array size and stops.

If the target was 5, how many steps would linear search take to find it according to the execution_table pattern?

A 2

B 1

C 3

D 4

💡 Hint

Look at how many steps linear search took to find 7 at index 2, then consider 5 is at index 1.

Concept Snapshot

Linear Search:
- Check each element from start to end
- Time: O(n) worst case

Binary Search:
- Requires sorted array
- Check middle element, reduce search space
- Time: O(log n) worst case

Binary search is faster but needs sorted data.

Full Transcript

This visual compares linear search and binary search by tracing their steps to find a target in an array. Linear search checks each element one by one until it finds the target or reaches the end. Binary search works only on sorted arrays and repeatedly splits the search range in half by checking the middle element. The execution table shows how linear search takes more steps when the target is near the end or not present, while binary search finds the target faster or concludes absence quicker by adjusting low and high pointers. Key moments clarify why binary search calculates the middle index and why it stops when the search space is empty. The quizzes test understanding of mid calculation, stopping conditions, and step counts. The snapshot summarizes the main differences and time complexities.