Binary Search vs Linear Search Real Cost Difference in DSA Java - Compare & Choose

Challenge - 5 Problems

❓ Predict Output

intermediate

Output of Linear Search on an Unsorted Array

What is the output of the following Java code that performs a linear search for the value 7 in an unsorted array?

DSA Java

public class SearchTest {
    public static int linearSearch(int[] arr, int target) {
        for (int i = 0; i < arr.length; i++) {
            if (arr[i] == target) {
                return i;
            }
        }
        return -1;
    }
    public static void main(String[] args) {
        int[] data = {4, 2, 7, 1, 9};
        System.out.println(linearSearch(data, 7));
    }
}

A 2

B -1

C 3

D 0

💡 Hint

Linear search returns the index of the first matching element.

The value 7 is at index 2 in the array. Linear search checks each element from start until it finds 7 and returns its index.

❓ Predict Output

intermediate

Output of Binary Search on a Sorted Array

What is the output of the following Java code that performs a binary search for the value 5 in a sorted array?

DSA Java

import java.util.Arrays;
public class SearchTest {
    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] == target) {
                return mid;
            } else if (arr[mid] < target) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }
        return -1;
    }
    public static void main(String[] args) {
        int[] data = {1, 3, 5, 7, 9};
        System.out.println(binarySearch(data, 5));
    }
}

A 2

B -1

C 1

D 3

💡 Hint

Binary search returns the index of the target if found in the sorted array.

The value 5 is at index 2 in the sorted array. Binary search finds it by repeatedly dividing the search interval.

🧠 Conceptual

advanced

Time Complexity Difference Between Linear and Binary Search

Which statement correctly describes the time complexity difference between linear search and binary search on an array of size n?

A Both linear and binary search take O(log n) time

B Linear search takes O(log n) time, binary search takes O(n) time

C Linear search takes O(n) time, binary search takes O(log n) time

D Both linear and binary search take O(n) time

💡 Hint

Binary search divides the search space in half each step.

Linear search checks each element one by one, so it takes O(n) time. Binary search divides the array in half each step, so it takes O(log n) time.

❓ Predict Output

advanced

Output of Binary Search on an Unsorted Array

What is the output of the following Java code that performs a binary search for the value 3 in an unsorted array?

DSA Java

public class SearchTest {
    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] == target) {
                return mid;
            } else if (arr[mid] < target) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }
        return -1;
    }
    public static void main(String[] args) {
        int[] data = {1, 5, 4, 2, 3};
        System.out.println(binarySearch(data, 3));
    }
}

A 1

B -1

C 2

D 0

💡 Hint

Binary search requires a sorted array to work correctly.

The array is unsorted, so binary search cannot reliably find the target. It returns -1 indicating not found.

🧠 Conceptual

expert

Real Cost Difference Between Binary and Linear Search in Practice

Which statement best explains the real cost difference between binary search and linear search when searching large sorted arrays?

A Binary search is slower because it requires sorting the array before searching

B Linear search is faster because it uses divide and conquer to reduce search space

C Binary search is always faster because it uses fewer comparisons regardless of data layout

D Linear search can be faster for small or nearly sorted data due to lower overhead and cache friendliness

💡 Hint

Consider overhead and data layout effects on performance.

Binary search uses fewer comparisons but has overhead and requires sorted data. Linear search can be faster on small or nearly sorted data due to simpler logic and better cache use.

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