slowest sort algorithm ever made

sneksort.js

const unsorted = [2, 3, 4, 5, 1, 7, 10, 20];

function snekSort(arr) {
  const out = [];
  for (let i in arr) {
    const current = arr[i];
    const next = arr[parseInt(i) + 1];
    if (i == arr.length - 1) out.splice(1, 0, arr[0]); // out.unshift(arr[0]);
    else if (current < next) out.push(next);
    else out.unshift(next);
  }
  return out;
}

console.log(snekSort(unsorted));