News for hackers. Stuff that matters.
Re:Bubblesort, rocksort, and cocktail-shaker sort by bluGill on Wednesday December 16, 2020 @08:32AM (#25442268)
You can trivially parallelize this algorithm to be O(1): for each permutation you create universes to check all finite lengths of the list in parallel and destroy the universes that check either less elements than are in the list or that run off the end of the list.

I'm not sure if this can extend to infinite size lists. Sorting infinite lists in finite time makes my head hurt.

There are no comments on this comment yet.