tranny demon hacker 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
Published at
2025-04-29 18:52:27Event JSON
{
"id": "5e9743f693ba66d1180d02462f483f9c790b4577204ebfd51dbabe038287106b",
"pubkey": "6e5b64a93f9c17d6528911485e399c8be0361c502e3c736e8118f8e00d950d0c",
"created_at": 1745952747,
"kind": 1,
"tags": [
[
"e",
"f1504c0ba2775aaec0b05b485d3c7b345530ce3181028bbfb17be35fa9aaed84",
"wss://relay.mostr.pub",
"reply"
],
[
"proxy",
"https://kolektiva.social/users/beka_valentine/statuses/114422759280083906",
"activitypub"
],
[
"client",
"Mostr",
"31990:6be38f8c63df7dbf84db7ec4a6e6fbbd8d19dca3b980efad18585c46f04b26f9:mostr",
"wss://relay.mostr.pub"
]
],
"content": "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\n\nif i give you just that condition and asymptotic, you might feel cheated",
"sig": "d7e24677a9926c156c360c3ef143d5befc68fc4a68d43d77df6df413a4a47750dd2d725e4450aaca0c4d975264fc7456d6d84d114490b0e5255d65dac21c39c4"
}
