Why Binary Search and What Sorted Order Gives You in DSA C++ - Challenge Your Understanding

Challenge - 5 Problems

❓ Predict Output

intermediate

Output of Binary Search on Sorted Array

What is the output of the following C++ code that performs binary search on a sorted array?

DSA C++

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

#include <iostream>
int main() {
    int arr[] = {2, 4, 6, 8, 10, 12};
    int index = binarySearch(arr, 6, 8);
    std::cout << index << std::endl;
    return 0;
}

A 3

B 2

C -1

D 4

💡 Hint

Remember that array indexing starts at 0 and binary search returns the index of the target if found.

The target 8 is at index 3 in the sorted array. Binary search finds it and returns the index.

🧠 Conceptual

intermediate

Why Must the Array Be Sorted for Binary Search?

Why is it necessary for the array to be sorted before applying binary search?

A Because binary search requires the array to be sorted in descending order only.

B Because binary search only works on arrays with unique elements.

C Because binary search compares the target with the middle element to decide which half to search next, which only works if the array is sorted.

D Because binary search can only be applied to arrays of even length.

💡 Hint

Think about how binary search decides which half of the array to search next.

Binary search relies on the order of elements to eliminate half of the search space each time. Without sorting, this logic fails.

❓ Predict Output

advanced

Result of Binary Search on Unsorted Array

What will be the output of this C++ code that runs binary search on an unsorted array?

DSA C++

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

#include <iostream>
int main() {
    int arr[] = {10, 2, 8, 4, 12, 6};
    int index = binarySearch(arr, 6, 4);
    std::cout << index << std::endl;
    return 0;
}

A -1

B 0

C 3

D 2

💡 Hint

Binary search assumes sorted order. What happens if the array is not sorted?

Since the array is not sorted, binary search may not find the target correctly and returns -1 indicating not found.

🔧 Debug

advanced

Identify the Bug in Binary Search Implementation

What is the bug in this binary search code that causes it to fail for some inputs?

DSA C++

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

A The condition in the while loop should be 'left < right' instead of 'left <= right'.

B The 'right' variable should be initialized to 'size - 1' instead of 'size'.

C The 'left' variable should be initialized to 1 instead of 0.

D The mid calculation should be 'mid = (left + right) / 2 + 1'.

💡 Hint

Check the valid index range for the array.

Array indices go from 0 to size-1. Initializing 'right' to 'size' causes out-of-bound access.

🧠 Conceptual

expert

Why Binary Search is More Efficient Than Linear Search on Sorted Data

Why is binary search more efficient than linear search when the data is sorted?

A Because binary search sorts the array first, then searches linearly.

B Because binary search checks every element sequentially but faster due to sorting.

C Because binary search uses hashing to find elements instantly.

D Because binary search divides the search space in half each step, reducing the number of comparisons to logarithmic time.

💡 Hint

Think about how many elements are left to check after each step in binary search.

Binary search cuts the search space in half each time, leading to O(log n) time, much faster than linear search's O(n).

Practice

1. Why is it important for a list to be sorted before applying binary search?

easy

A. Because binary search can only search for numbers, not strings

B. Because binary search divides the list based on order to find elements quickly

C. Because binary search works only on lists with unique elements

D. Because binary search requires the list to be reversed

Solution

1. Step 1: Understand binary search working

   Binary search works by repeatedly dividing the list into halves and deciding which half to search next based on order.

2. Step 2: Importance of sorted order

   If the list is not sorted, dividing by order does not help because elements are not arranged predictably.

3. Final Answer:

   Because binary search divides the list based on order to find elements quickly -> Option B

4. Quick Check:

   Sorted list needed for binary search [OK]

Hint: Binary search needs sorted data to halve search space fast [OK]

Common Mistakes:

• Thinking binary search works on unsorted lists
• Confusing binary search with linear search
• Believing binary search requires unique elements

2. Which of the following is the correct syntax to perform binary search on a sorted vector v in C++ using std::binary_search?

easy

A. std::binary_search(v.begin(), v.end(), target);

B. std::binary_search(v, target);

C. binary_search(v, 0, v.size(), target);

D. std::binary_search(target, v.begin(), v.end());

Solution

1. Step 1: Recall std::binary_search parameters

   It takes two iterators marking the start and end of the range, and the target value.

2. Step 2: Match correct syntax

   std::binary_search(v.begin(), v.end(), target); correctly uses v.begin(), v.end(), and target in that order.

3. Final Answer:

   std::binary_search(v.begin(), v.end(), target); -> Option A

4. Quick Check:

   Correct iterator usage in binary_search [OK]

Hint: Use begin() and end() iterators with binary_search [OK]

Common Mistakes:

• Passing vector directly without iterators
• Swapping target and iterator arguments
• Using incorrect function signature

3. What will be the output of the following C++ code?

std::vector<int> v = {2, 4, 6, 8, 10};
bool found = std::binary_search(v.begin(), v.end(), 6);
std::cout << (found ? "Found" : "Not Found") << std::endl;

medium

A. Runtime Error

B. Not Found

C. Compilation Error

D. Found

Solution

1. Step 1: Check if vector is sorted

   The vector {2, 4, 6, 8, 10} is sorted in ascending order.

2. Step 2: Apply binary_search for 6

   6 is present in the vector, so binary_search returns true.

3. Final Answer:

   Found -> Option D

4. Quick Check:

   6 exists in sorted vector, so output is Found [OK]

Hint: Check if target is in sorted list to predict binary_search output [OK]

Common Mistakes:

• Assuming binary_search returns index instead of bool
• Forgetting vector must be sorted
• Confusing output strings

4. Identify the error in the following code snippet that attempts to use binary search:

std::vector<int> v = {5, 3, 1, 4, 2};
bool found = std::binary_search(v.begin(), v.end(), 3);
std::cout << (found ? "Yes" : "No") << std::endl;

medium

A. Missing include for vector header

B. binary_search syntax is incorrect

C. The vector is not sorted before binary_search

D. The target value 3 is not in the vector

Solution

1. Step 1: Check vector order

   The vector {5, 3, 1, 4, 2} is not sorted.

2. Step 2: Understand binary_search requirement

   binary_search requires the vector to be sorted; otherwise, the result is undefined or incorrect.

3. Final Answer:

   The vector is not sorted before binary_search -> Option C

4. Quick Check:

   Unsorted vector breaks binary_search [OK]

Hint: Always sort before binary_search to avoid wrong results [OK]

Common Mistakes:

• Ignoring the need to sort before searching
• Assuming binary_search sorts internally
• Thinking target absence causes error

5. Given a sorted vector v = {1, 3, 5, 7, 9, 11}, you want to find the smallest element greater than or equal to 6 using binary search logic. Which approach correctly achieves this?

hard

A. Use std::lower_bound to find the first element not less than 6

B. Use std::binary_search to check if 6 exists, then pick next element

C. Use std::upper_bound to find the first element greater than 6, then subtract one

D. Sort the vector again before searching

Solution

1. Step 1: Understand the problem

   We want the smallest element >= 6, which is the definition of lower bound.

2. Step 2: Choose correct function

   std::lower_bound returns iterator to first element not less than the target, perfect for this need.

3. Step 3: Analyze other options

   binary_search only tells presence, upper_bound finds strictly greater elements, sorting again is unnecessary.

4. Final Answer:

   Use std::lower_bound to find the first element not less than 6 -> Option A

5. Quick Check:

   Lower bound finds smallest element >= target [OK]

Hint: Use lower_bound for smallest element >= target in sorted list [OK]

Common Mistakes:

• Using binary_search to find element position
• Confusing upper_bound with lower_bound
• Unnecessary sorting before search