Thanks so much! Please also kindly subscribe! You can find all of my Data Structures and Algorithm lessons in this playlist: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Thank you Garu! Please kindly share with your friends and subscribe to support me ~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Thank you Nurulfadillah! I'm glad you like my explanation! If you know anyone who needs help with this class, kindly share it with them and also subscribe to support me (it means a lot) ~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Thank you Carolinarojano! Please kindly share with your friends and subscribe to support me (it means a lot) ~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Thanks so much M3ga! I will try to work on Big Omega and Big Theta once I finish my exams haha. Please don't forget to subscribe! As well, you can find all of my Data Structures & Algorithms videos in this playlist: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Thank you so much! Please kindly share with your friends and subscribe to support me (it means a lot) ~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Thank you for your kind words Shuyao! Please kindly share with your friends and subscribe ~ all of my CS videos are in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
You're welcome Joseph! Please kindly share and subscribe~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Thanks CatchesTale! Good luck! Also, please kindly share with your friends and subscribe to support me (it means a lot) ~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Hi thank you for your video. To prove big Theta, do I have to prove big O and big Omega and if both are true big Theta is proved? Also could you tell me following: The way to find a constant c, we are choosing the one that we are trying to proove (for example xxx = O(n²). So on the right side of "is larger or equal than) all of the values will have to be larger than on the left side but max. as n². What happens if we cannot choose a larger one by this definition? So if it is 100n³ = O(n²) we cannot choose n² as the largest. Many thanks from Germany!!
You're welcome Marz! I'm glad you like my explanation! If you know anyone who needs help with this class, kindly share it with them and also subscribe to support me (it means a lot) ~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Thanks NazeliBrahim! Please kindly share with your friends and subscribe to support me (it means a lot) ~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Thanks so much Thiên Phúc! I'm working on the one for Theta and Omega; you can find all of my CS videos in this playlist here (don't forget to share and kindly subscribe!): ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
You're welcome! You can find all of my CS videos in this playlist (don't forget to share and kindly subscribe!): ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
N not is the same as k :) some textbooks use different variables but they mean the same thing! Also I'm really glad to hear that you find my method easier! I would really appreciate if you could kindly share or subscribe ~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Thank you James! I'm glad you like my explanation! If you know anyone who needs help with this class, kindly share it with them and also subscribe to support me (it means a lot) ~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
For the 5n^2 + 3nlogn + 2n + 5 is O(n^2) I got constant C = 12 because instead of raising nlogn to n^2 I just dropped it all together 5n^2 + 3nlogn + 2n + 5
You're welcome Muhammed! Please kindly share and subscribe~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Không có gì bạn! Bạn có thể tìm tất cả clip của mình về Computer Science trong link này nhé (bạn đừng quên chia sẻ và đăng kí hihi): ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Thank you! I have videos on Big Theta and other topics too! Pls don't forget to share with your classmates and kindly subscribe ~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Do you mean the one at 1:12? Ok, now imagine you're in a math class. Let's say you have f(x) = x and g(x) = x^2. Since g(x) is quadratic, and f(x) is linear, then it must be that g(x) > f(x) meaning g(x) will at some point intersect f(x) and be above it forever. Agreed? You can also pick g(x) = x^3 or whatever you want and g(x) is still greater than f(x). Now, coming back to 1:12, let's say f(x) = 2n + 3. Can we find a function greater than this one? Yes. We can say the function 2n + 3n or 2n^2 + 3 or whatever you want. But for the sake of simplicity, let's pick 2n + 3n. Therefore, you get 2n + 3 < 2n + 3n. Does that make sense? Don't overcomplicate it. It's easier than it looks.
@@seketorianGaming No worries! You can find all of my Data Structures & Algorithms videos in this playlist: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
youre the best tutor in the game for computer science & math, please don't stop making these videos
Thanks very much! I will never stop making videos :)
1.50 mins and I'm finally understand the concept. Thank you so much!
I'm glad it was helpful! You can find the Big Ω video here: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
So much helper than a lecture in colleage,much straightforward,i will recommend to my classmate,thanks!!!
Thanks so much! Please also kindly subscribe! You can find all of my Data Structures and Algorithm lessons in this playlist: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Abssolutely agree, what a man, Thanks !!!
Bro, I have an exam in couple of days and you saved me, may god bless you
Thank you! Don't forget to see my video on Big Omega! You can find the link here: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Thank you so much! This is what I was looking for.
Excellent video! 🎉
This video was great, really liked the way you simplified each step and made it easy to understand 👍
Thank you Garu! Please kindly share with your friends and subscribe to support me ~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
dude you're awesome. thank you so much for your videos
Thank you Nurulfadillah! I'm glad you like my explanation! If you know anyone who needs help with this class, kindly share it with them and also subscribe to support me (it means a lot) ~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Thank you very much, this is what i needed to land down the concepts i had.
Thank you Carolinarojano! Please kindly share with your friends and subscribe to support me (it means a lot) ~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Than you so much you made it so easy to understand how to do the formal way.
Thanks so much M3ga! I will try to work on Big Omega and Big Theta once I finish my exams haha. Please don't forget to subscribe! As well, you can find all of my Data Structures & Algorithms videos in this playlist: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
In 2 minutes you explained well what my professor struggled for in a semester.
Thank you so much! Please kindly share with your friends and subscribe to support me (it means a lot) ~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
bro is helping me pass csi2110 right now
finally well understand. Thank you very much
Thank you for your kind words Shuyao! Please kindly share with your friends and subscribe ~ all of my CS videos are in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
This was really helpful, thank you
You're welcome Joseph! Please kindly share and subscribe~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Thank you very much for making me understand this thing!!!😭
You're very welcome! You can find all of my CS videos in this playlsit: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Thank you very much. I'm writing exam today on this
Thanks CatchesTale! Good luck! Also, please kindly share with your friends and subscribe to support me (it means a lot) ~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
that's what im looking for man!
I'm glad it helped! You can find all of my Computer Science videos here: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Hi thank you for your video. To prove big Theta, do I have to prove big O and big Omega and if both are true big Theta is proved?
Also could you tell me following:
The way to find a constant c, we are choosing the one that we are trying to proove (for example xxx = O(n²). So on the right side of "is larger or equal than) all of the values will have to be larger than on the left side but max. as n².
What happens if we cannot choose a larger one by this definition? So if it is
100n³ = O(n²) we cannot choose n² as the largest.
Many thanks from Germany!!
I actually have videos on Big Omega/Theta! You can find it here: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Thank you💗💗
You're welcome Marz! I'm glad you like my explanation! If you know anyone who needs help with this class, kindly share it with them and also subscribe to support me (it means a lot) ~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
PERFECT
Thanks NazeliBrahim! Please kindly share with your friends and subscribe to support me (it means a lot) ~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
What a great channel !!😮💓💓
Thanks so much! You can find all of my CS videos here: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
bro is the GOAT
Thanks so much Thiên Phúc! I'm working on the one for Theta and Omega; you can find all of my CS videos in this playlist here (don't forget to share and kindly subscribe!): ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Thank you!
You're welcome! You can find all of my CS videos in this playlist (don't forget to share and kindly subscribe!): ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Hi could I ask what n not is? In our class we use C and K but I find your method to be easier.
N not is the same as k :) some textbooks use different variables but they mean the same thing! Also I'm really glad to hear that you find my method easier! I would really appreciate if you could kindly share or subscribe ~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
youre my goat
Thank you James! I'm glad you like my explanation! If you know anyone who needs help with this class, kindly share it with them and also subscribe to support me (it means a lot) ~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
For the 5n^2 + 3nlogn + 2n + 5 is O(n^2)
I got constant C = 12 because instead of raising nlogn to n^2 I just dropped it all together
5n^2 + 3nlogn + 2n + 5
Yes that should be fine :) You can find all of my CS videos here: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
super video
Thanks so much! You can find all of my CS videos in this link here: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
thank yooooou
You're welcome Muhammed! Please kindly share and subscribe~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
cảm ơn bạn ơi
Không có gì bạn! Bạn có thể tìm tất cả clip của mình về Computer Science trong link này nhé (bạn đừng quên chia sẻ và đăng kí hihi): ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
I love you
Thank you! I have videos on Big Theta and other topics too! Pls don't forget to share with your classmates and kindly subscribe ~ you can find all of my CS videos in this link: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
howd you get 2n + 3n
Hi Timmy, please let me know the timestamp of the question you're referring to.
Do you mean the one at 1:12? Ok, now imagine you're in a math class. Let's say you have f(x) = x and g(x) = x^2. Since g(x) is quadratic, and f(x) is linear, then it must be that g(x) > f(x) meaning g(x) will at some point intersect f(x) and be above it forever. Agreed? You can also pick g(x) = x^3 or whatever you want and g(x) is still greater than f(x). Now, coming back to 1:12, let's say f(x) = 2n + 3. Can we find a function greater than this one? Yes. We can say the function 2n + 3n or 2n^2 + 3 or whatever you want. But for the sake of simplicity, let's pick 2n + 3n. Therefore, you get 2n + 3 < 2n + 3n. Does that make sense? Don't overcomplicate it. It's easier than it looks.
@@QuocDatPhung Thank you, this helped. And you're correct I think I over complicated it.
@@seketorianGaming No worries! You can find all of my Data Structures & Algorithms videos in this playlist: ruclips.net/p/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC
Don't you think c^n is bigger than n^c
Yes, in the video I said that c^n is bigger than n^c at 5:20