Sleep Sort in JavaScript (No Threads!)

sleepsort.js

// Raymond Ho
// JavaScript makes Sleep Sort so easy to implement..
// Exponentially slower if sorting larger numbers.

function sleepNumber(number) {
	// The timeout is (n^2) so that close numbers are no longer close.
	// Example: 1 is really close to 2, but 1^2 isn't close to 2^2.
    setTimeout(function(){
        console.log(number);
    }, number*number);
}

function sleepSort(array) {
    for (i = 0; i < array.length; ++i){
    	sleepNumber(array[i]);
    }
}

// Generate 100 random numbers for sorting.
randoms = [];
for (i = 0; i < 100; ++i) {
    // Random number between 1 - 100
    randomInt = Math.floor((Math.random()*100) + 1);
    randoms.push(randomInt); 
}

// Sort said random numbers.
sleepSort(randoms);

Typescript/Bun implementation:

const sleepSort = async (arr: number[]) => {
  const result: number[] = [];

  await Promise.all(
    arr.map(async (n) => {
      await Bun.sleep(n);
      result.push(n);
    })
  );

  return result;
};

console.log(await sleepSort([11, 4, 1, 6, 3, 7, 9, 5]));

Interesting! I didn't know Bun has a sleep API