|
|
|
|
|
|
by DroneBetter
3 days ago
|
|
|
i hate every time i hear about spaghettisort. it is still O(n) weight to transport, so O(n^2) amortised; if you liken having a stronger hand that can carry more spaghetti to parallelisation, it's beaten by O(log^2 n) sorting algorithms on parallelised classical computers. |
|
|