News for hackers. Stuff that matters.
Re:Demonstrating Web Worker: Sorting a 50K array in your bro... by CyberDildonics on Sunday May 31, 2015 @05:26PM (#9635627)
It is still a huge win since copying is both O(N) and cache coherent, while sorting is of course O(N log(N))

There are no comments on this comment yet.