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.
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.