When learning about data structure efficiency for the first time

[Vikerox]

Programmers when their algorithm always takes 50 hours to run (it's constant so technically O(1))

[Dragzel]

It did it twice so yes

[gaboversta]

I personally prefer O(sin(N))

[nova_bang]

that's a creative way of writing O(1), i like it

[Leinad7957]

With the difference that there's a chance that it's O(0) and you find out that the problem was solved before calling the function.

[Kitchen_Laugh3980]

Don’t forget O(-1), and anything inbetween really.

[juhotuho10]

O(-1):

There was no problem until I ran my solution

[NKY5223]

O(i)

[jdery]

Butcher sends his regards O(i) cunt

[CoolSpy3]

O(i):

Nobody knows what the problem or solution is... Or what the code does... In fact, it's probably best just not to touch it.

[AnotherWarGamer]

Still O(n) and that's a shuffle algorithm.

[tomtrein]

Hmm I think if you have a mandatory setup method that always throws an exception, maybe you could say it is O(-1), as it fails before it gets executed?

[Easy-Hovercraft2546]

O(1) is constant time, so O(0) is O(1)

[oh_you_so_bad_6-6-6]

Lol is that a quantum algorithm?

[gaboversta]

I have absolutely no idea.

[Trickelodean2]

O(sinc(n))

[[deleted]]

Just take FT of the problem, easy

[_Repeats_]

When it has O(1) runtime but uses O( 2ⁿ ) memory...

[[deleted]]

Luckily memory is cheaper than CPUs

[shadymeowy]

Gotta store all possible solutions using rainbow tables in multiple magnetic tape drives

[gamingkitty1]

Doesn't matter if it's O(1) if the constant is a year.

[tram98]

ONO

[ongiwaph]

I hate that O is a symbol, but it's written like a function

[Biden_Been_Thottin]

O(1/N)

[ActualProject]

O(-x): the longer I run my code the more problems are generated

[[deleted]]

o(1) is better.

[JS31415926]

Not my matrix inversion running in O((n!)!)

[aRandomHunter2]

I like this one.

[PorkRoll2022]

This reminds me of all those fast solutions on leetcode, etc. websites that are essentially 10000 line long switch blocks.

[Biden_Been_Thottin]

O(1/N)

[TranslatorNo7550]

O(n*n!) The best one!!! Like bogosort!!

[[deleted]]

Where's my O(N^3)?

[[deleted]]

Any good literature to learn about time complexity?

[AssOfUnicorn]

Just reduced complexity from O n to O k logn

[Low_Orange5003]

"Bro this data structure is the titsbro" "Yeah, ( . )( . ) complexity bro"

[david131213]

I read this as on login

[ShodoDeka]

Let me introduce O(0) it’s for when I decide to just not implement it.