So, here's my version of chronosort: Given a set of natural numbers, place them all on a timer, with a timeout equal to the number, and callback argument also equal to the number. The callback function simply appends its argument to the end of a shared list. At some point you will have a sorted and (eventually) complete list :)
It's queue-sort. You put the elements into a priority queue, then remove them in property order and put them into a list.
Here you just use the inherent queue of a timer system, which wastes time between extracting the next element. That's silly and inefficient, and disingenuous in trying to hide the queue.
For examples, https://hn.algolia.com/?q=sleepsort , https://stackoverflow.com/questions/6474318/what-is-the-time... , https://stackoverflow.com/questions/74917807/is-there-any-pr...