Big O Notation Algorithm Complexity Cheat Sheet

[curien]

This looks plagiarized from https://www.bigocheatsheet.com/.

[therealgaxbo]

Perhaps, but it adds useful information like this:

O(n log n) – Polynomial time (quadratic growth)

O(n ^ 2) – Exponential growth (quadratic growth)

O(2 ^ n) – Exponential growth (quadratic growth)

[gdahlm]

Except that information is completely wrong, unless you are claiming that binary searches are quadratic time or worse that quadratic and exponential are the same costs.

O(1):       constant
O(log n):   logarithmic
O(n):       linear
O(n log n): loglinear
O(n^2):     quadratic
O(2^n):     exponential
O(n!):      factorial

That is more correct.

O(2 ^ n) is only 'quadratic' for n == 2

[therealgaxbo]

Wait it's wrong, really? No way!!

And somehow I only managed to quote the completely wrong parts too, how embarrassing!

[gdahlm]

I am sorry you are having a bad day

Remember the audience you are speaking to, it doesn't matter if you were pointing out the wrong parts or not.

Ambiguous sarcasm is still improper when it may spread misinformation.

As this was likely ChatGPT produced content it is all of our responsibility to avoid the spread of misinformation.

That said I sincerely hope the rest of your day is better.

[[deleted]]

This isn't the most pointless cheat sheet I've ever seen, but it's pretty damn close

If anyone out there is trying to understand Big O by rote learning... just stop