iJustErikk

// recursively divides then merges
const mergeSort = (curSubArr) => {
  if (curSubArr.length <= 1) return curSubArr;
  const middle = Math.floor(curSubArr.length / 2);
  const left = curSubArr.slice(0, middle);
  const right = curSubArr.slice(middle);
  return merge(mergeSort(left), mergeSort(right));
};
const merge = (left, right) => {
  let pointerA = 0;

iJustErikk

def indexOf(text, string):
    for i in range(len(text)):
        didBreak = False
        for j in range(len(string)):
            if (i+j >= len(text)):
                didBreak = True
                break
            if (text[i + j] != string[j]):
                didBreak = True
                break