@JPDev@programming.dev to Programmer Humor@programming.dev • 1 year agoReturns a sorted list in O(1) timeprogramming.devimagemessage-square27arrow-up1294
arrow-up1294imageReturns a sorted list in O(1) timeprogramming.dev@JPDev@programming.dev to Programmer Humor@programming.dev • 1 year agomessage-square27
minus-square@murtaza64@programming.devlinkfedilink12•1 year agoyou can make it sort the first k elements and it will still be O(1). Set k high enough and it might even be useful
minus-square@xmunk@sh.itjust.workslinkfedilink5•1 year agoI set k to 50,000,000,000… that’s more items than my shitty computer can fit in memory (including swsp) but I am now happy to celebrate my O(1) algorithm.
minus-squareKubeRootlinkfedilink2•1 year agoBy that logic, any sorting implementation is O(1), as the indexing variable/address type has limited size
you can make it sort the first k elements and it will still be O(1). Set k high enough and it might even be useful
I set k to 50,000,000,000… that’s more items than my shitty computer can fit in memory (including swsp) but I am now happy to celebrate my O(1) algorithm.
By that logic, any sorting implementation is O(1), as the indexing variable/address type has limited size