Recursive

findMin.js

const findMin = nums => findMinRec(nums[0], nums);
const findMinRec = (curr, nums) => {
  if (nums.length === 0) return curr;

  const min = curr < nums[0] ? curr : nums[0];
  return findMinRec(min, nums.splice(1))
}

console.log(findMin([1, 2, 3]))
console.log(findMin([-10, 42, 18, 37, 99, -100]))
console.log(findMin([-1, -2, -3]))