Divide & Conquer vs Linear Search

TARGET_ID:

🔴

O(n)
SEQUENTIAL

🔵

O(log n)
D & C

LINEAR STEPS: 0

BINARY STEPS: 0

Linear Search

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

Binary Search

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