Differences between Tight Big O, Tight Big Omega, and Tight Big Theta

In this video, I will explain the differences between Tight Big O, Tight Big Omega, and Tight Big Theta. I will show you how to prove or disprove Big Omega Ω. For example, you are asked to prove that a function 2n^3 - 7n + 1 is Ω(n^3). By the definition of big O, f(n) is O(g(n)) if you can find a positive constant c and a positive integer nₒ such that f(n) is less than or equal to c times g(n), for all n is greater than nₒ. By the definition of big Omega, f(n) is Ω(g(n)) if f(n) is greater than or equal to c*g(n)
Knowing how to prove that something is Big O or not Big O is an important skill that Computer Science CS and Math students need to know about time complexity and growth of functions. It is likely that you will encounter this topic in your typical Data Structures, Discrete Mathematics, or Analysis of Algorithm courses at University.
I will also how you how to prive Big Omega Ω or Big Theta θ. If you enjoyed this video, please don't forget to comment down below and also subscribe if you haven't already!

[@oeunbunsan2509]

Hello, brother Could you please talking about Counting sort😊

[@QuocDatPhung]

I'm working on it! So far I have videos on selection sort, insertion, bubble, mergesort, and quicksort! You can find them here: ua-cam.com/play/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC.html

[@oeunbunsan2509]

@@QuocDatPhung I already watched all of your videos many time and you are the best DSA teacher😊❤️️

[@QuocDatPhung]

@@oeunbunsan2509 Thanks so much! I really appreciate it! :D

[@someone-xm4ik]

Thank you so much! You explained the concept very simply. But I did not find the video for big theta.

[@QuocDatPhung]

Thank you for your kind words! 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: ua-cam.com/play/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC.html