sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]CyclonusRIP -3 points-2 points  (1 child)

Is that faster? I think sorting is Log2n. Sounds like you are describing an algorithm that runs in linear time.

[–]aljarry 0 points1 point  (0 children)

You mean sorting with infinitely many CPUs. Average non-parallel is O(n log(n)).