timeoutSort

cm0002@lemmy.world · 8 months ago

sus@programming.dev · 8 months ago

it’s

while (true) {
    let t = Date.now();
    if (timeoutMap.has(t)) timeoutMap[t]();
}

of course. Clearly O(n).

disclaimer

Feel free to use it. I guarantee it is bug free. Comes with express warranty. This notice is legally binding.

yetAnotherUser@lemmy.ca · 8 months ago

Then don’t complain once you get arrested…

FooBarrington@lemmy.world · 8 months ago

I found a way to optimize your code without affecting the result. By making it branchless, I was able to get my CPU to 100% utilization!