Why Binary Search Iterative Approach in DSA Typescript?

The Big Idea

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

The Scenario

Imagine you have a huge phone book with thousands of names sorted alphabetically. You want to find the phone number for a friend. If you start from the first page and look at every name one by one, it will take a very long time.

The Problem

Searching one by one is slow and tiring. It wastes time because you check many names unnecessarily. Also, it is easy to lose your place or make mistakes when flipping through so many pages.

The Solution

Binary search helps by quickly cutting the search area in half each time. Instead of checking every name, you jump to the middle, decide if your friend's name is before or after, and then only search that half. This way, you find the name much faster and with fewer mistakes.

Before vs After

✗ Before

function findName(names: string[], target: string): number {
  for (let index = 0; index < names.length; index++) {
    if (names[index] === target) {
      return index;
    }
  }
  return -1;
}

✓ After

function binarySearch(names: string[], target: string): number {
  let left = 0;
  let right = names.length - 1;
  while (left <= right) {
    const middle = Math.floor((left + right) / 2);
    if (names[middle] === target) return middle;
    else if (names[middle] < target) left = middle + 1;
    else right = middle - 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 scanning every page.

Key Takeaways

Manual search checks every item, which is slow for big lists.

Binary search cuts the search space in half repeatedly for speed.

It works only on sorted lists but makes searching very efficient.

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 the goal of binary search

   Binary search is used to find a target value in a sorted array by dividing the search space repeatedly.

2. Step 2: Identify the iterative approach

   The iterative approach uses a loop to narrow down the search range until the target is found or the range 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 algorithms
• Thinking binary search works on unsorted arrays
• Assuming it finds max/min values

2. Which of the following is the correct way to initialize the middle index in an iterative binary search in TypeScript?

easy

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

B. const mid = Math.floor((low + high) / 2);

C. const mid = Math.ceil((low + high) / 2);

D. const mid = low + high;

Solution

1. Step 1: Understand index calculation in binary search

   The middle index must be an integer index, so we use Math.floor to round down the division result.

2. Step 2: Check each option

   const mid = (low + high) / 2; returns a float, const mid = Math.floor((low + high) / 2); correctly floors the value, const mid = Math.ceil((low + high) / 2); rounds up which can cause errors, const mid = low + high; sums indices without division.

3. Final Answer:

   const mid = Math.floor((low + high) / 2); -> Option B

4. Quick Check:

   Use Math.floor for middle index [OK]

Hint: Always floor the average of low and high [OK]

Common Mistakes:

• Using division without flooring causing float index
• Using ceil which may skip elements
• Adding indices without dividing

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

function binarySearch(arr: number[], target: number): number {
  let low = 0;
  let high = arr.length - 1;
  while (low <= high) {
    const mid = Math.floor((low + high) / 2);
    if (arr[mid] === target) return mid;
    else if (arr[mid] < target) low = mid + 1;
    else high = mid - 1;
  }
  return -1;
}

const result = binarySearch([2, 4, 6, 8, 10], 6);
console.log(result);

medium

A. 2

B. 3

C. -1

D. 4

Solution

1. Step 1: Trace the binary search for target 6

   Initial low=0, high=4, mid=2 (element 6). arr[mid] equals target, so return 2.

2. Step 2: Confirm output

   Function returns index 2, which is printed.

3. Final Answer:

   2 -> Option A

4. Quick Check:

   Target 6 found at index 2 [OK]

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

Common Mistakes:

• Off-by-one errors in index calculation
• Returning wrong index when target found
• Confusing return value with element value

4. Identify the bug in this iterative binary search code snippet and select the correct fix:

function binarySearch(arr: number[], target: number): number {
  let low = 0;
  let high = arr.length;
  while (low <= high) {
    const mid = Math.floor((low + high) / 2);
    if (arr[mid] === target) return mid;
    else if (arr[mid] < target) low = mid + 1;
    else high = mid - 1;
  }
  return -1;
}

medium

A. Change let high = arr.length; to let high = arr.length - 1;

B. Change low <= high to low < high

C. Change mid = Math.floor((low + high) / 2); to mid = Math.ceil((low + high) / 2);

D. Remove the else before if (arr[mid] < target)

Solution

1. Step 1: Identify the initialization error

   High should be the last valid index, which is arr.length - 1, not arr.length.

2. Step 2: Understand impact of wrong high value

   Setting high to arr.length causes out-of-bound access at arr[mid] when mid equals arr.length.

3. Final Answer:

   Change let high = arr.length; to let high = arr.length - 1; -> Option A

4. Quick Check:

   High index must be last valid array index [OK]

Hint: High index = array length minus one [OK]

Common Mistakes:

• Setting high to array length causing out-of-bounds
• Changing loop condition incorrectly
• Using ceil instead of floor for mid

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

hard

A. When arr[mid] equals target, update low to mid + 1 and continue searching right

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

C. When arr[mid] equals target, update high to mid - 1 and continue searching left

D. Use recursion instead of iteration

Solution

1. Step 1: Understand the problem with duplicates

   Standard binary search returns any occurrence, not necessarily the first.

2. Step 2: Modify search to find first occurrence

   When target found at mid, move high to mid - 1 to continue searching left side for earlier occurrence.

3. Step 3: Keep track of potential answer

   Store mid as potential answer and continue until low > high.

4. Final Answer:

   When arr[mid] equals target, update high to mid - 1 and continue searching left -> Option C

5. Quick Check:

   Move left on match to find first occurrence [OK]

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

Common Mistakes:

• Returning immediately on first match
• Searching right side on match
• Ignoring duplicates in binary search