4 ms·
Sleepsort is fastest sorting algo in some cases already. It complexity: O(max(input)+n). It bad algo for CPU, of course, but should be OK for massive parallel a
by v_lisivka 9y ago
Sleepsort is fastest sorting algo in some cases already. It complexity: O(max(input)+n). It bad algo for CPU, of course, but should be OK for massive parallel architecture or a FPGA.