Why is it so hard for people to understand the big O notation? Everyone I see talk about it gets it wrong, including >80% of IQfy.
Why is it so hard for people to understand the big O notation? Everyone I see talk about it gets it wrong, including >80% of IQfy.
>Making this fricking thread again
Wrong.
Wrong.
Wrong.
Wrong
Pity reply
better question, why is it so hard for IQfy to pick an anime mascot?
we have lain, satania, miku, kurisu and teto.
but could you say no to this bunny girl?
kurisu should be IQfy, she's not into computers
but i am into kurisu
Chris-chan belongs to IQfy, end of discussion.
what the frick is wrong with this artist and why does he keep putting that ugly random texture in all of his art
>could you say no to this bunny girl?
yes. but only as a response to "stop!!".
next time you make this thread I'm gonna frick your mom in the ass on your father's bed
Wrong
I understand the theory, but I cannot for the life of me apply it to existing algorithms
Like everything else programmers do they overcomplicate computer science ideas intentionally so as to make themselves feel important for understanding esoteric things, but the truth is that if they can't explain things in simple terms so that anyone else including a child can understand it, then they don't understand it themselves. Furthermore it's how pajeets get one up on eachother and I refuse to be a part of it.
Wrong.
I actually see more people get little o wrong much more frequently
Examples? I've literally never seen anyone get little o wrong. o is a bit niche so people who've heard of it tend to know what it means.
People tend to remember "tends to zero faster than ..." but get it wrong when its something growing instead of shrinking. More common in physics where big O is used as a "plus higher-order terms" placeholder without too much thought. Not that common in pure math past a certain point because of what you say.
And then there are CSgays and engineers who get both wrong for some reason.
>"tends to zero faster than ..."
use O notation to compare AV1 and VP9
VP9 is O(n) while AV1 is O(n^2)
as you can see, AV1 is slower, particularly in encoding
the n is specially chosen but will not be elaborated upon
O(n^2) is not slower than O(n)
and you're not slower than the other kids, just different
>O(n^2) is not slower than O(n)
it literally is though when the input (N) approaches infinity. that's literally what O notation is about... it's talking about lim_{Inf}
>it literally is though when the input (N) approaches infinity
Wrong.
Wrong.
>wrong
ok moron.
Smarter than you but ok.
>asserts quadratic functions are not in fact slower than linear ones
ya, you're pretty fricking stupid. learn what O means you Black person.
Asymptotically quadratic functions grow faster than linear ones, correct. That wasn't your claim though.
Because it's irrelevant for optimization for the common programmer. Even morons will intuitively grasp what makes programs faster or slower. Only 0.1% will approach optimization mathematically and actually require big O.
it's only needed for job interviews and trivial algorithms from 50 years ago
It's showtime
And everyone forgets about o, Ω, ω, and Θ.
they're harder to analyze to be fair...
now that's the real shit
specifying the best case and worst case is so much better than just O
weed out autistics in American tech industry
pedantic and wrong, what a beautiful combination
Do explain what they get wrong about it, anon.
>they
wrong
A lot of things are hard for people with less than 120 IQ
Ask me how I know your IQ is 120.
I never got tested tbh
Why not? Go get tested right now.
Because nobody actually uses bigO once you get a real job and stop trying to dick wave your tech knowledge.
Now shut the frick up and get back to centering DIV tags.
I have not seen anyone use Big O for anything beyond my second year of college. Nobody uses this shit in the working world.
Big O is how many orgasms you have while programming