Why Binary Search Iterative Approach in DSA Go?

The Big Idea

What if you could find anything in a huge list in just a few steps?

The Scenario

Imagine you have a thick phone book and you want to find a friend's phone number. You start from the first page and check every name one by one until you find your friend.

The Problem

This method is very slow and tiring because you might have to look through hundreds or thousands of pages. It is easy to lose your place or make mistakes, and it wastes a lot of time.

The Solution

Binary search helps by quickly cutting the search area in half each time. Instead of checking every page, you open the book in the middle, decide if your friend is in the first or second half, and then repeat this process. This way, you find the number much faster and with fewer mistakes.

Before vs After

✗ Before

for i := 0; i < len(numbers); i++ {
    if numbers[i] == target {
        return i
    }
}
return -1

✓ After

left, right := 0, len(numbers)-1
for left <= right {
    mid := left + (right - left) / 2
    if numbers[mid] == target {
        return mid
    } else if numbers[mid] < target {
        left = mid + 1
    } else {
        right = mid - 1
    }
}
return -1

What It Enables

Binary search enables lightning-fast searching in sorted lists, making large data easy to handle.

Real Life Example

When you search for a word in a dictionary app, binary search helps find the word instantly instead of flipping through every page.

Key Takeaways

Manual searching checks every item and is slow.

Binary search cuts the search space in half each step.

This makes searching much faster and efficient.

Practice

1. What is the main purpose of the mid variable in the iterative binary search algorithm?

easy

A. To keep track of the number of iterations

B. To store the target value to search

C. To find the middle index of the current search range

D. To hold the entire array being searched

Solution

1. Step 1: Understand the role and importance of mid in binary search

   The mid variable calculates the middle index between the current low and high indices to split the search range. By checking the element at mid, the algorithm decides whether to search the left or right half next, making the search efficient.

2. Final Answer:

   To find the middle index of the current search range -> Option C

3. Quick Check:

   mid = middle index [OK]

Hint: Mid splits search range in half each step [OK]

Common Mistakes:

• Confusing mid with target value
• Using mid as a counter instead of index
• Not updating mid inside the loop

2. Which of the following is the correct way to calculate the middle index mid in Go to avoid integer overflow?

easy

A. mid := (low + high) / 2

B. mid := (high - low) / 2

C. mid := (low - high) / 2

D. mid := low + (high - low) / 2

Solution

1. Step 1: Understand integer overflow risk and safe calculation

   Adding low + high directly can overflow if both are large integers. Calculating mid as low + (high - low) / 2 avoids overflow by subtracting first.

2. Final Answer:

   mid := low + (high - low) / 2 -> Option D

3. Quick Check:

   Safe mid calculation avoids overflow [OK]

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

Common Mistakes:

• Using (low + high)/2 directly causing overflow
• Subtracting incorrectly causing negative mid
• Confusing order of operations

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

package main
import "fmt"

func binarySearch(arr []int, target int) int {
    low, high := 0, len(arr)-1
    for low <= high {
        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
}

func main() {
    arr := []int{2, 4, 6, 8, 10}
    result := binarySearch(arr, 6)
    fmt.Println(result)
}

medium

A. 3

B. 2

C. -1

D. 0

Solution

1. Step 1: Trace the binary search for target 6 and verify return

   Array is [2,4,6,8,10]. Initial low=0, high=4. mid=2. arr[2]=6 matches target. Function returns mid = 2 immediately.

2. Final Answer:

   2 -> Option B

3. Quick Check:

   Index of 6 in array = 2 [OK]

Hint: Check mid index value equals target first [OK]

Common Mistakes:

• Returning value instead of index
• Off-by-one errors in mid calculation
• Not updating low/high correctly

4. Identify the bug in this iterative binary search code snippet in Go:

func binarySearch(arr []int, target int) int {
    low, high := 0, len(arr)
    for low <= high {
        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. The initial value of high should be len(arr) - 1

B. The loop condition should be low < high

C. The mid calculation causes overflow

D. The function should return arr[mid] instead of mid

Solution

1. Step 1: Check high initialization and correct it

   High is set to len(arr), which is out of array index range (max index is len(arr)-1). Set high to len(arr) - 1 to avoid index out of range error when accessing arr[mid].

2. Final Answer:

   The initial value of high should be len(arr) - 1 -> Option A

3. Quick Check:

   High = len(arr)-1 fixes index error [OK]

Hint: High index must be last valid array index [OK]

Common Mistakes:

• Setting high to len(arr) causing runtime error
• Using wrong loop condition
• Returning value instead of index

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. When arr[mid] == target, update high = mid - 1 and continue searching

B. Return mid immediately when arr[mid] == target

C. When arr[mid] == target, update low = mid + 1 and continue searching

D. Use linear search after binary search to find first occurrence

Solution

1. Step 1: Understand duplicates issue and modify search logic

   Standard binary search returns any occurrence, not necessarily the first. When arr[mid] == target, move high to mid - 1 to continue searching left side for earlier occurrence, but store mid as potential answer.

2. Final Answer:

   When arr[mid] == target, update high = mid - 1 and continue searching -> Option A

3. Quick Check:

   Adjust high to find first occurrence [OK]

Hint: Move high left on match to find first occurrence [OK]

Common Mistakes:

• Returning immediately on first match
• Moving low right on match losing first occurrence
• Using linear search unnecessarily