code: function searchSorted (inputArray, values) {
    let i;
    const indexes = [];
    const len = values.length;
  
    inputArray.sort(function (a, b) {
      return a - b;
    });
  
    for (i = 0; i < len; i++) {
      indexes[i] = getRank(inputArray, values[i]);
    }
  
    return indexes;
  }
docs: Find the indices into a sorted array a such that, if the corresponding elements
  In v were inserted before the indices, the order of a would be preserved.
  http://lagrange.univ-lyon1.fr/docs/numpy/1.11.0/reference/generated/numpy.searchsorted.html
  @param {Array} inputArray The array where the values will be inserted
  @param {Array} values An array of the values to be inserted into the inputArray
  @returns {Array} The indices where elements should be inserted to maintain order.
  @memberof Colors