O(n) algorithm to find min and max

minMax.js

function minMax(array) {
  if (array.length <= 1) {
    return [ array[0], array[0] ];
  } else if (array.length == 2) {
    return array[0] < array[1] ? [ array[0], array[1] ] : [ array[1], array[0] ];
  } else {
    const breakpt = array.length / 2;
    const [ minLeft, maxLeft ] = minMax(array.slice(0, Math.floor(breakpt)));
    const [ minRight, maxRight ] = minMax(array.slice(Math.floor(breakpt)));
    return [ minLeft < minRight ? minLeft : minRight,
             maxLeft > maxRight ? maxLeft : maxRight ];
  }
}