qaz@lemmy.world to

Programmer Humor@programming.devEnglish · 7 days ago

Who cares about time complexity

447

Who cares about time complexity

qaz@lemmy.world to

Programmer Humor@programming.devEnglish · 7 days ago

Chat

TheLazyNerd@europe.pub
link
fedilink
English
arrow-up
19·
6 days ago
Since Roman numerals have an upper bound, the time complexity is always O(1).

Programmer Humor@programming.dev

programmer_humor@programming.dev

You are not logged in. However you can subscribe from another Fediverse account, for example Lemmy or Mastodon. To do this, paste the following into the search field of your instance: [email protected]

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

Visibility: Public

This community can be federated to other instances and be posted/commented in by their users.

662 users / day
3.68K users / week
9.5K users / month
19.3K users / 6 months
1 local subscriber
26.9K subscribers
1.87K Posts
67.3K Comments
Modlog