Join Nostr
2025-04-29 18:52:27 UTC
in reply to

beka valentine on Nostr: for instance, if you're sorting arrays of distinct ints (not integers), then all ...

for instance, if you're sorting arrays of distinct ints (not integers), then all relevant sorting algorithms are in fact constant time O(1), because the size of the list has an upper bound

if i give you just that condition and asymptotic, you might feel cheated