280

Returns a sorted list in O(1) time(programming.dev)

posted
by
Avatar
JPDev@programming.dev
in
Avatar
programmer_humor@programming.dev
27 comments
hidereport
Sort:
HotTopControversialNewOld
You are viewing a single thread.
View all comments View context
Avatar
murtaza64@programming.dev
12 points

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

permalink
report
parent
reply
Avatar
xmunk@sh.itjust.works
5 points

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.

permalink
report
parent
reply
Avatar
KubeRoot@discuss.tchncs.de
1 point

By that logic, any sorting implementation is O(1), as the indexing variable/address type has limited size

permalink
report
parent
reply

Programmer Humor

!programmer_humor@programming.dev

Create post

Welcome to Programmer Humor!

This is a place where you can post jokes, memes, humor, etc. related to programming!

For sharing awful code theres also Programming Horror.

Rules

  • Keep content in english
  • No advertisements
  • Posts must be related to programming or programmer topics

Community stats

  • 7.7K

    Monthly active users

  • 977

    Posts

  • 38K

    Comments

Community moderators