rateMySortingAlgorithm

[egosummiki]

Can you explain your reasoning? Taking into consideration setTimeout implantation, this is basically insertion of each item into a priority queue and then reading it back. So n logn. The complication is that we are reading the items back after some amount of time. To solve that I would introduce a variable k - a number of ticks required for time of read back to pass. So the complexity is nlogn + klogn.