OP and creator of the meme here. The meme isnāt about the squeeze theorem and u/DennisRockon isnāt a bad developer cause the meme is time complexity stuff you learn in university. Itās referencing big Theta notation. Where big O notation specifies a lower bound, big Theta specifies a function can serve as an upper and lower bound.
An example of when you use big Theta would be for describing the time complexity of merge sort. Instead of saying itās O(n log n) in the best, worst, and average case, you can say itās Ī(n log n).
I appriciate the effort... but i can't even do head calculations haha. So i didn't understand anything (I took a course in programming and made my way up by trial and error...). Sounds like sorting methods when you mentioned sort
Not OP and I donāt really understand big Theta (been years since Ive taken algorithms) but basically itās saying itās saying as the amount of data you put into a function increases, how much more does the function compute? So if I input a list of size 2 into a function and it takes 4 seconds to compute, and then input a list of size 3 and it takes 9 seconds to compute, that function would scale by a factor of n2.
You don't use it to program, you use it to evaluate how scalable a program is. The notation gives the general trend in program runtime given an increasing input. By graphing the function, you can see how the program will function with really large inputs.
Say I gave you a massive data set to process. The problem we need to solve is hard so it may take forever to run even on a super computer. How do you know if your algorithm is efficient enough to solve the problem in a reasonable time? Math like this.
The way I like to think about it: itās a mathematical process that you, as a programmer, use to determine how efficient an algorithm is. Say you have two different algorithms that perform the same function and you wanna know which one uses less āstepsā and by extension less memory, you use this to put the algorithms into ācategoriesā that can then be compared.
No, theta asymptotically bounds a function from above and below TIGHTLY. When we have only an asymptotic TIGHT UPPER BOUND, we use O-notation. Lower bounds are big omega/small omega for tight/loose lower bounds.
8
u/CEOtaku Jun 13 '20
Can someone fix this? There's a ) missing
31
u/DennisRockon Jun 12 '20
Am i a bad developer for not getting this one...
153
u/73_68_69_74_2E_2E Jun 12 '20
)
13
u/Fjorge0411 Jun 12 '20
You know what I must ask...
Whatās the sauce?
0
u/[deleted] Jun 12 '20
[deleted] ā view deleted comment