Searching Algorithms (linear search, binary search)

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

Requires sorted array
Checks every element sequentially
This linear search implementation demonstrates key characteristics: 1) Sequential element-by-element examination, 2) No pre-conditions on array order, 3) Returns index immediately upon finding target, 4) Returns -1 if element not found, 5) Time complexity of O(n) in worst case, 6) Simple and straightforward implementation, 7) Suitable for small arrays or unsorted data, 8) No additional memory requirements beyond loop counter.
Uses recursion
Binary splitting