Binary Search vs Linear Search Real Cost Difference in DSA Python - Compare & Choose

Challenge - 5 Problems

❓ Predict Output

intermediate

Output of Linear Search on a Sorted List

What is the output of the following Python code that performs a linear search for the number 7 in a sorted list?

DSA Python

def linear_search(arr, target):
    for i, val in enumerate(arr):
        if val == target:
            return i
    return -1

arr = [1, 3, 5, 7, 9, 11]
result = linear_search(arr, 7)
print(result)

A 3

B -1

C 4

D 0

💡 Hint

Linear search returns the index of the first matching element.

The number 7 is at index 3 in the list. Linear search checks each element until it finds 7 and returns its index.

❓ Predict Output

intermediate

Output of Binary Search on a Sorted List

What is the output of the following Python code that performs a binary search for the number 7 in a sorted list?

DSA Python

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

arr = [1, 3, 5, 7, 9, 11]
result = binary_search(arr, 7)
print(result)

A -1

B 2

C 3

D 4

💡 Hint

Binary search divides the list and finds the target index efficiently.

The number 7 is at index 3. Binary search finds it by checking the middle element and narrowing the search range.

🧠 Conceptual

advanced

Time Complexity Comparison

Which statement correctly compares the time complexity of linear search and binary search on a sorted list of size n?

A Linear search is O(n), binary search is O(log n)

B Linear search is O(log n), binary search is O(n)

C Both linear and binary search are O(n)

D Both linear and binary search are O(log n)

💡 Hint

Binary search cuts the search space in half each step.

Linear search checks each element one by one, so it takes O(n) time. Binary search divides the list repeatedly, taking O(log n) time.

❓ Predict Output

advanced

Output When Binary Search is Used on an Unsorted List

What is the output of the following code when binary search is used on an unsorted list to find the number 7?

DSA Python

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

arr = [9, 1, 11, 7, 3, 5]
result = binary_search(arr, 7)
print(result)

A 4

B 3

C 0

D -1

💡 Hint

Binary search requires a sorted list to work correctly.

The list is unsorted, so binary search cannot reliably find the target. It returns -1 indicating not found.

🧠 Conceptual

expert

Real Cost Difference in Practice

Which factor most affects the real-world performance difference between linear search and binary search on large datasets?

A The color of the text editor

B Whether the data is sorted or not

C The size of the computer's screen

D The programming language used

💡 Hint

Binary search only works correctly if data is sorted.

Binary search requires sorted data to work efficiently. If data is unsorted, linear search is the only option, affecting performance.

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