Binary Search Iterative Approach in DSA C# - Build from Scratch

Binary Search Iterative Approach

📖 Scenario: You have a sorted list of book IDs in a library. You want to quickly find if a specific book ID is available using a fast searching method.

🎯 Goal: Build a program that uses the iterative binary search method to find a book ID in a sorted list.

📋 What You'll Learn

Create a sorted integer array called bookIds with the exact values: 101, 203, 305, 407, 509, 611, 713

Create an integer variable called targetId and set it to 407

Write an iterative binary search using a while loop with variables left, right, and mid

Print the index of targetId in bookIds if found, otherwise print -1

💡 Why This Matters

🌍 Real World

Binary search is used in many applications like searching in databases, looking up words in dictionaries, or finding items in sorted lists quickly.

💼 Career

Understanding binary search is fundamental for software developers and data scientists to write efficient search algorithms and optimize performance.

1

Create the sorted array of book IDs

Create an integer array called bookIds with these exact values: 101, 203, 305, 407, 509, 611, 713

DSA C#

// Your code here

Hint

Use square brackets [] to create an array and list the numbers inside curly braces {}.

2

Set the target book ID to search

Create an integer variable called targetId and set it to 407

DSA C#

int[] bookIds = {101, 203, 305, 407, 509, 611, 713};
// Your code here

Hint

Use int targetId = 407; to create the variable.

3

Write the iterative binary search logic

Write a while loop to perform iterative binary search using variables left, right, and mid. Update left or right based on comparison with targetId. Use bookIds[mid] to compare.

DSA C#

int[] bookIds = {101, 203, 305, 407, 509, 611, 713};
int targetId = 407;
// Your code here

Hint

Use left and right to track the search range. Calculate mid inside the loop. Compare bookIds[mid] with targetId to decide which half to search next.

4

Print the search result

Print the value of the variable index which holds the position of targetId in bookIds. If not found, it should print -1.

DSA C#

int[] bookIds = {101, 203, 305, 407, 509, 611, 713};
int targetId = 407;

int left = 0;
int right = bookIds.Length - 1;
int index = -1;

while (left <= right)
{
    int mid = left + (right - left) / 2;
    if (bookIds[mid] == targetId)
    {
        index = mid;
        break;
    }
    else if (bookIds[mid] < targetId)
    {
        left = mid + 1;
    }
    else
    {
        right = mid - 1;
    }
}

// Your code here

Hint

Use Console.WriteLine(index); to print the result.

Practice

1. What is the main purpose of the Binary Search Iterative Approach in a sorted array?

easy

A. To find the maximum value in the array

B. To sort the array elements in ascending order

C. To reverse the array elements

D. To find the position of a target value efficiently by repeatedly dividing the search interval in half

Solution

1. Step 1: Understand binary search goal

   Binary search aims to find a target value's position quickly by checking the middle element and narrowing the search range.

2. Step 2: Identify iterative approach

   The iterative method uses a loop to repeatedly divide the search interval until the target is found or the interval is empty.

3. Final Answer:

   To find the position of a target value efficiently by repeatedly dividing the search interval in half -> Option D

4. Quick Check:

   Binary search = efficient target search [OK]

Hint: Binary search halves the search space each step [OK]

Common Mistakes:

• Confusing binary search with sorting
• Thinking it reverses the array
• Assuming it finds max value

2. Which of the following is the correct way to calculate the middle index in an iterative binary search in C# to avoid overflow?

easy

A. int mid = low + (high - low) / 2;

B. int mid = (low + high) / 2;

C. int mid = (low - high) / 2;

D. int mid = (low * high) / 2;

Solution

1. Step 1: Understand overflow risk

   Adding low and high directly can cause integer overflow if values are large.

2. Step 2: Use safe middle calculation

   Calculating mid as low + (high - low) / 2 avoids overflow by subtracting before adding.

3. Final Answer:

   int mid = low + (high - low) / 2; -> Option A

4. Quick Check:

   Safe mid calculation = low + (high - low) / 2 [OK]

Hint: Use low + (high - low) / 2 to prevent overflow [OK]

Common Mistakes:

• Using (low + high) / 2 causing overflow
• Subtracting incorrectly in mid calculation
• Multiplying indices instead of adding

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

int[] arr = {2, 4, 6, 8, 10};
int target = 6;
int low = 0, high = arr.Length - 1;
int result = -1;
while (low <= high) {
  int mid = low + (high - low) / 2;
  if (arr[mid] == target) {
    result = mid;
    break;
  } else if (arr[mid] < target) {
    low = mid + 1;
  } else {
    high = mid - 1;
  }
}
Console.WriteLine(result);

medium

A. -1

B. 3

C. 2

D. 0

Solution

1. Step 1: Trace the binary search steps

   Initial low=0, high=4, mid=2 (element 6). arr[2] == target 6, so result=2 and loop breaks.

2. Step 2: Output the result

   Since target found at index 2, Console.WriteLine prints 2.

3. Final Answer:

   2 -> Option C

4. Quick Check:

   Target 6 found at index 2 [OK]

Hint: Check middle element first to find target quickly [OK]

Common Mistakes:

• Confusing index with value
• Not updating low or high correctly
• Assuming target not found returns 0

4. Identify the error in the following iterative binary search code snippet and choose the correct fix:

int BinarySearch(int[] arr, int target) {
  int low = 0, high = arr.Length - 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;
}

medium

A. Change while condition to 'while (low <= high)'

B. Change mid calculation to '(low + high) / 2'

C. Remove 'return -1;' at the end

D. Change 'low = mid + 1;' to 'low = mid - 1;'

Solution

1. Step 1: Analyze loop condition

   The loop uses 'while (low < high)', which misses checking when low equals high, possibly skipping the last element.

2. Step 2: Correct loop condition

   Changing to 'while (low <= high)' ensures all elements are checked including when low equals high.

3. Final Answer:

   Change while condition to 'while (low <= high)' -> Option A

4. Quick Check:

   Loop must include low == high to check all elements [OK]

Hint: Use <= in loop to include last element check [OK]

Common Mistakes:

• Using < instead of <= in loop condition
• Incorrect mid calculation causing overflow
• Wrong update of low or high pointers

5. Given a sorted array with possible duplicate elements, how can you modify the iterative binary search to find the first occurrence of a target value?

hard

A. Return immediately when target is found

B. When target is found, continue searching left half to find earlier occurrence

C. Search only the right half after finding target

D. Use linear search instead of binary search

Solution

1. Step 1: Understand duplicates in sorted array

   Duplicates mean target can appear multiple times; we want the first index where it appears.

2. Step 2: Modify binary search to find first occurrence

   When target found at mid, record mid but continue searching left half (high = mid - 1) to find earlier occurrence.

3. Final Answer:

   When target is found, continue searching left half to find earlier occurrence -> Option B

4. Quick Check:

   Find first occurrence by searching left after match [OK]

Hint: On match, move left to find first occurrence [OK]

Common Mistakes:

• Stopping search immediately on first match
• Searching right half after finding target
• Switching to linear search unnecessarily