Binary Search vs Linear Search Real Cost Difference in DSA Java - Interactive Comparison Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to perform a linear search that returns the index of the target or -1 if not found.

DSA Java

public static int linearSearch(int[] arr, int target) {
    for (int i = 0; i < arr.length; i++) {
        if (arr[i] == [1]) {
            return i;
        }
    }
    return -1;
}

Drag options to blanks, or click blank then click option'

Aarr

Bi

C0

Dtarget

Attempts:

3 left

💡 Hint

Common Mistakes

Using the loop index 'i' instead of the target for comparison.

Comparing arr[i] with arr instead of target.

The code compares each element arr[i] with the target value to find the index.

2fill in blank

medium

Complete the code to perform a binary search on a sorted array to find the target index or return -1 if not found.

DSA Java

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

Drag options to blanks, or click blank then click option'

Aright

Bmid

Ctarget

Dleft

Attempts:

3 left

💡 Hint

Common Mistakes

Comparing arr[mid] with mid instead of target.

Using left or right instead of target for comparison.

The binary search compares the middle element arr[mid] with the target to decide the search direction.

3fill in blank

medium

Complete the code to return the worst-case time complexity of linear search.

DSA Java

public static String linearTimeComplexity() {
    return "[1]";
}

Drag options to blanks, or click blank then click option'

AO(1)

BO(n)

CO(log n)

DO(n^2)

Attempts:

3 left

💡 Hint

Common Mistakes

Confusing with best case O(1).

Thinking it is quadratic O(n^2).

Linear search worst case requires checking all n elements, O(n). This highlights the real cost difference for large arrays compared to binary search O(log n).

4fill in blank

hard

Fix the error in the binary search code: complete the condition to correctly update the left pointer when target is greater than mid element.

DSA Java

if (arr[mid] < [1]) {
    left = mid + 1;
}

Drag options to blanks, or click blank then click option'

Atarget

Bmid

Cleft

Dright

Attempts:

3 left

💡 Hint

Common Mistakes

Using mid instead of target in the comparison.

Using left or right instead of target.

When the middle element is less than the target, move the left pointer to mid + 1 to search the right half.

5fill in blank

hard

Complete the code to return the worst-case time complexity of binary search on a sorted array.

DSA Java

public static String binaryTimeComplexity() {
    return "[1]";
}

Drag options to blanks, or click blank then click option'

AO(log n)

BO(n)

CO(1)

DO(n^2)

Attempts:

3 left

💡 Hint

Common Mistakes

Confusing with linear O(n).

Thinking it is quadratic O(n^2).

Binary search halves the search space each step, leading to O(log n) worst-case time. For large n (e.g., 1 million), log n ≈ 20 vs linear's 1 million operations.

Practice

1. Which search algorithm is generally faster on a sorted list of 1,000,000 elements?

easy

A. Binary Search because it divides the list repeatedly

B. Linear Search because it checks elements one by one

C. Both have the same speed on sorted lists

D. Linear Search because it uses less memory

Solution

1. Step 1: Understand Binary Search on sorted lists

   Binary Search splits the list in half each time, quickly narrowing down the search.

2. Step 2: Compare with Linear Search

   Linear Search checks each element one by one, which is slower for large lists.

3. Final Answer:

   Binary Search because it divides the list repeatedly -> Option A

4. Quick Check:

   Binary Search faster on sorted lists = C [OK]

Hint: Binary Search halves the list each step, so it's faster [OK]

Common Mistakes:

• Thinking Linear Search is faster on sorted lists
• Confusing memory use with speed
• Assuming both have same speed

2. Which of the following is the correct syntax to start a binary search in Java on an array named arr?

easy

A. int index = arr.binarySearch(target);

B. int index = Arrays.binarySearch(arr, target);

C. int index = binarySearch(arr, target);

D. int index = binary_search(arr, target);

Solution

1. Step 1: Recall Java's binary search method

   Java provides binary search as a static method in the Arrays class.

2. Step 2: Match syntax with options

   Correct syntax is Arrays.binarySearch(array, value).

3. Final Answer:

   int index = Arrays.binarySearch(arr, target); -> Option B

4. Quick Check:

   Java binary search method = Arrays.binarySearch [OK]

Hint: Use Arrays.binarySearch for binary search in Java [OK]

Common Mistakes:

• Trying to call binarySearch directly on array
• Using wrong method name like binary_search
• Assuming binarySearch is an instance method

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

int[] arr = {2, 4, 6, 8, 10};
int target = 6;
int index = Arrays.binarySearch(arr, target);
System.out.println(index);

medium

A. 0

B. -1

C. 2

D. 3

Solution

1. Step 1: Understand Arrays.binarySearch behavior

   It returns the index of the target if found, else a negative value.

2. Step 2: Find target 6 in array

   Array is {2,4,6,8,10}, 6 is at index 2 (0-based).

3. Final Answer:

   2 -> Option C

4. Quick Check:

   Index of 6 in arr = 2 [OK]

Hint: Binary search returns index if found, else negative [OK]

Common Mistakes:

• Confusing index with value
• Expecting -1 when element is present
• Miscounting array indexes

4. Identify the error in this linear search Java method:

public static int linearSearch(int[] arr, int target) {
  for (int i = 1; i <= arr.length; i++) {
    if (arr[i] == target) {
      return i;
    }
  }
  return -1;
}

medium

A. Loop index starts at 1 and goes to arr.length, causing ArrayIndexOutOfBoundsException

B. The method should use binary search instead of linear search

C. The method should return the value, not the index

D. The loop should use 'i < arr.length' instead of 'i <= arr.length' and start at 0

Solution

1. Step 1: Check loop index range

   Array indexes start at 0, so loop should start at 0 and run while i < arr.length.

2. Step 2: Identify error in current loop

   Loop starts at 1 and uses i <= arr.length, which causes out-of-bounds access.

3. Final Answer:

   The loop should use 'i < arr.length' instead of 'i <= arr.length' and start at 0 -> Option D

4. Quick Check:

   Array index range is 0 to length-1 [OK]

Hint: Array indexes start at 0; loop must respect this [OK]

Common Mistakes:

• Starting loop at 1 instead of 0
• Using <= instead of < in loop condition
• Confusing index with value

5. You have a sorted array of 10 million elements. You want to find if a number exists. Which approach is best to minimize real cost (time and operations), and why?

hard

A. Use Binary Search because it reduces the number of comparisons drastically

B. Use Linear Search because it is simple and requires no sorting

C. Use Linear Search but start from the middle of the array

D. Use Binary Search only if the array is unsorted

Solution

1. Step 1: Consider array size and sorting

   Array is sorted and very large (10 million elements).

2. Step 2: Compare search costs

   Linear Search checks elements one by one, up to 10 million checks worst case. Binary Search halves search space each step, needing about 24 comparisons (log2(10,000,000)).

3. Step 3: Choose best approach

   Binary Search is much faster and minimizes real cost in time and operations.

4. Final Answer:

   Use Binary Search because it reduces the number of comparisons drastically -> Option A

5. Quick Check:

   Binary Search halves search space, so fewer steps [OK]

Hint: Binary Search is best for large sorted arrays [OK]

Common Mistakes:

• Choosing Linear Search for large sorted arrays
• Starting Linear Search from middle doesn't help
• Using Binary Search on unsorted arrays without sorting