4 ms·
It is still a huge win since copying is both O(N) and cache coherent, while sorting is of course O(N log(N))
by CyberDildonics 11y ago
It is still a huge win since copying is both O(N) and cache coherent, while sorting is of course O(N log(N))
4 ms·