Binary Search vs Linear Search Real Cost Difference in DSA Python - Build Both Approaches

Binary Search vs Linear Search Real Cost Difference

📖 Scenario: You are helping a store manager find the price of a product in a sorted price list. You will compare two ways to find the price: checking one by one (linear search) and jumping to the middle to narrow down (binary search). This will show how much faster binary search is.

🎯 Goal: Build a program that searches for a product price in a sorted list using both linear search and binary search. Count how many checks each method makes and print the counts to compare their real cost.

📋 What You'll Learn

Create a sorted list called prices with these exact values: [5, 12, 19, 23, 38, 45, 56, 67, 78, 89]

Create a variable called target_price and set it to 38

Write a linear search using a for loop with variables index and price to find target_price in prices and count checks in linear_checks

Write a binary search using while loop and variables left, right, mid to find target_price in prices and count checks in binary_checks

Print the counts of checks for linear and binary search exactly as: print(f"Linear search checks: {linear_checks}") and print(f"Binary search checks: {binary_checks}")

💡 Why This Matters

🌍 Real World

Searching sorted data quickly is important in many apps like price lookups, phone books, and databases.

💼 Career

Understanding search algorithms helps in optimizing software performance and writing efficient code.

1

Create the sorted price list

Create a list called prices with these exact values: [5, 12, 19, 23, 38, 45, 56, 67, 78, 89]

DSA Python

# Create the sorted list prices
# Your code here

Hint

Use square brackets and commas to create the list exactly as shown.

2

Set the target price to find

Create a variable called target_price and set it to 38

DSA Python

prices = [5, 12, 19, 23, 38, 45, 56, 67, 78, 89]
# Set the target price to 38
# Your code here

Hint

Use the equals sign to assign 38 to target_price.

3

Write linear search to count checks

Write a linear search using a for loop with variables index and price to find target_price in prices. Create a variable linear_checks initialized to 0 and increase it by 1 each time you check a price. Stop the loop when you find the target.

DSA Python

prices = [5, 12, 19, 23, 38, 45, 56, 67, 78, 89]
target_price = 38
# Write linear search with index, price and linear_checks
# Your code here

Hint

Use enumerate(prices) to get index and price. Increase linear_checks inside the loop. Use break to stop when found.

4

Write binary search and print both counts

Write a binary search using a while loop with variables left, right, and mid to find target_price in prices. Create a variable binary_checks initialized to 0 and increase it by 1 each time you check the middle price. Stop the loop when you find the target or when left is greater than right. Then print the counts exactly as: print(f"Linear search checks: {linear_checks}") and print(f"Binary search checks: {binary_checks}")

DSA Python

prices = [5, 12, 19, 23, 38, 45, 56, 67, 78, 89]
target_price = 38
linear_checks = 0
for index, price in enumerate(prices):
    linear_checks += 1
    if price == target_price:
        break
# Write binary search with left, right, mid, binary_checks
# Print linear_checks and binary_checks
# Your code here

Hint

Use left and right to narrow the search. Increase binary_checks each loop. Print counts exactly as shown.

Practice

1. Which search algorithm is generally faster on a sorted list of 1,000,000 elements?

easy

A. Binary Search

B. Linear Search

C. Both are equally fast

D. Neither works on sorted lists

Solution

1. Step 1: Understand the search algorithms

   Binary Search divides the list in half repeatedly, while Linear Search checks each element one by one.

2. Step 2: Compare efficiency on large sorted lists

   Binary Search takes about log2(1,000,000) ≈ 20 steps, Linear Search takes up to 1,000,000 steps.

3. Final Answer:

   Binary Search -> Option A

4. Quick Check:

   Binary Search is faster on sorted lists [OK]

Hint: Binary Search halves search space; Linear checks all [OK]

Common Mistakes:

• Thinking Linear Search is faster on sorted lists
• Confusing sorted and unsorted list requirements
• Ignoring the difference in number of steps

2. Which of the following is the correct syntax to start a binary search on a sorted list named arr in Python?

easy

A. arr.binary_search(target)

B. bisect.bisect_left(arr, target)

C. binary_search(arr, target)

D. search(arr, target)

Solution

1. Step 1: Recall Python's binary search method

   Python's standard library uses the bisect module for binary search operations.

2. Step 2: Identify correct function call

   bisect.bisect_left(arr, target) returns the insertion point using binary search.

3. Final Answer:

   bisect.bisect_left(arr, target) -> Option B

4. Quick Check:

   Use bisect module for binary search in Python [OK]

Hint: Use bisect module for binary search in Python [OK]

Common Mistakes:

• Assuming binary_search is a built-in function
• Trying to call binary_search as a method on list
• Using generic search functions without binary search

3. What is the output of the following code snippet?

def linear_search(arr, target):
    for i in range(len(arr)):
        if arr[i] == target:
            return i
    return -1

arr = [2, 4, 6, 8, 10]
print(linear_search(arr, 8))

medium

A. 3

B. 4

C. -1

D. Error

Solution

1. Step 1: Trace the linear search function

   The function checks each element from index 0 to 4 for the target 8.

2. Step 2: Find the target index

   At index 3, arr[3] is 8, so function returns 3.

3. Final Answer:

   3 -> Option A

4. Quick Check:

   Index of 8 in list is 3 [OK]

Hint: Linear search returns index of first match [OK]

Common Mistakes:

• Confusing index with value
• Assuming zero-based index starts at 1
• Expecting output to be value instead of index

4. Find the error in this binary search implementation and select the correct fix:

def binary_search(arr, target):
    low = 0
    high = len(arr)
    while low <= high:
        mid = (low + high) // 2
        if arr[mid] == target:
            return mid
        elif arr[mid] < target:
            low = mid + 1
        else:
            high = mid - 1
    return -1

medium

A. No error, code is correct

B. Change while low <= high to while low < high

C. Change mid calculation to mid = (low + high + 1) // 2

D. Change high = len(arr) to high = len(arr) - 1

Solution

1. Step 1: Check high initialization

   Indexing in Python is zero-based, so last index is len(arr) - 1, not len(arr).

2. Step 2: Understand loop condition and indexing

   Using high = len(arr) causes index out of range error when mid equals len(arr).

3. Final Answer:

   Change high = len(arr) to high = len(arr) - 1 -> Option D

4. Quick Check:

   High must be last valid index [OK]

Hint: High index = length minus one for zero-based lists [OK]

Common Mistakes:

• Setting high to length instead of last index
• Changing loop condition incorrectly
• Modifying mid calculation unnecessarily

5. You have a sorted list of 10,000 elements and want to find a target value. Which search method is more efficient in terms of average number of comparisons, and why?

Options:
A) Linear Search because it checks elements sequentially.
B) Linear Search because it works on sorted lists.
C) Binary Search because it reduces search space by half each step.
D) Binary Search because it checks every element once.

hard

A. Linear Search because it checks elements sequentially.

B. Linear Search because it works on sorted lists.

C. Binary Search because it reduces search space by half each step.

D. Binary Search because it checks every element once.

Solution

1. Step 1: Analyze average comparisons for Linear Search

   Linear Search checks elements one by one, so average comparisons ≈ 10,000/2 = 5,000.

2. Step 2: Analyze average comparisons for Binary Search

   Binary Search halves the list each step, so comparisons ≈ log2(10,000) ≈ 14.

3. Step 3: Compare efficiency

   Binary Search requires far fewer comparisons on large sorted lists.

4. Final Answer:

   Binary Search because it reduces search space by half each step. -> Option C

5. Quick Check:

   Binary Search is more efficient on sorted lists [OK]

Hint: Binary Search halves search space, fewer comparisons [OK]

Common Mistakes:

• Thinking Linear Search is faster on sorted lists
• Believing Binary Search checks every element
• Ignoring the effect of list size on comparisons