Spaghetti Sort (2018)

Re:Spaghetti Sort (2018) by FartyMcFarter on Monday September 30, 2019 @03:00AM (#21112411)

I suppose one could add a step 0 to the algorithm:

0: Manufacture a pair of hands big enough to hold all the spaghetti you'll need in the later steps.

Does this step take linear time as well?

[ Parent | on HN ]

Re:Spaghetti Sort (2018) by madmax96 on Tuesday October 01, 2019 @01:18PM (#21127942)

Does it take O(n) time to manufacture computer memory? I don’t know, but it doesn’t affect the runtime of algorithms.

[ Parent | on HN ]

Re:Spaghetti Sort (2018) by FartyMcFarter on Tuesday October 01, 2019 @05:27PM (#21130888)

But many sorting algorithms work in-place, so they don't require extra memory beyond a small O(1) or O(log n) amount for bookkeeping.

When algorithms do require extra memory, they state this requirement as the space complexity.

[ Parent | on HN ]