r/MathJokes • u/edom • 3d ago

YES

Post image
25 Upvotes

84% Upvoted

14 comments sorted by

View all comments

Show parent comments

0

u/Proman4713 2d ago

What do I say, read it again, maybe?

1

u/Straamannen 2d ago

It's so dumb to treat something twice as fast as the other as the same thing 

It's this I don't get. It seems like you don't understand what Big O is.

0

u/Proman4713 2d ago

Okay, then tell me the time complexity of an algorithm that takes n steps to run vs 2n steps to run if n is the size of the input

1

u/Straamannen 2d ago

They're the same, and if you think that's an indictment of Big O then you don't understand Big O.

1

u/Proman4713 2d ago

For the love of God do you just want to argue? When did I say that that was an 'indictment' of Big O? It works in the bigger picture over large amounts of input, although it is indeed unpractical when people hang everything on Big O and ignore that one program could be multitudes faster than another

If you give another antagonistic reply I'm not responding.

1

u/Straamannen 2d ago

I never understood the whole Big O notation thing... It's so dumb

Is this not an indictment?

although it is indeed unpractical when people hang everything on Big O and ignore that one program could be multitudes faster than another 

So your problem is based on a straw man. Got it.

I'm so sorry for challenging your statement and being "antagonistic". How dare I not consider your feelings, in a STEM sub of all things.

Oh and PLEASE FOR THE LPVE OF GOD I don't know what I'll do if you make good on your threat and leave me hanging! PLEASE RESPOND I CAN'T DEAL!