How to Prove or Disprove Big Ω - Introduction to Computer Science

[@ErgoBytes]

Awesome dude, really glad to find a video that focuses on the mathematics and isn't just a conceptual overview.

[@QuocDatPhung]

Thank you Levy Skulk! 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: kzbin.info/aero/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC

[@guestboy342]

I have a question. Instead of the trial-and-error method in the video, is it possible to solve for nₒ or n using the inequality? Thanks in advance! Your channel is underrated and I hope it grows bigger in the future.

[@QuocDatPhung]

Yes you can use the inequality to solve for nₒ. However, let's say that inequality is very complicated like nlogn + sqrt(n) >= c * nₒ or something like that. It's very hard to solve for nₒ so that's why I recommend trying nₒ = 1, 2, 3, ... until it works. You can find all of my CS videos in the following link (don't forget to share and kindly subscribe!): kzbin.info/aero/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC

[@MohdAasif-bg4wl]

11:28 nlogn is greater than n in time so, for omega the value should not be less than n but u wrote nlogn which is greater ? i know in Big O we can take the values greater than the current time function can we do same for theta?

[@QuocDatPhung]

Ok, let's go back to 10:53 to see why I used the example 3x - 2 = 3x -2 From there we know 3x - 2 >= 3x - 2x. That's because we are subtracting 2x on the right hand side (subtracting more than the left hand side). Make sure you understand this. Very important. Now, let's look at 3nlogn - 2n = 3nlogn - 2n. From there we know 3nlogn - 2n >=- 3nlogn - 2nlogn. Since nlogn is greater than n, we are now subtracting more on the right hand side, which is why the inequality sign is >= Does this make sense? Let me know. All of these problems and solutions are from the Data Structures and Algorithms in Java textbook (6th edition) by Michael Goodrich.

[@akashsangwan3964]

You know how to teach!!

[@QuocDatPhung]

Thank you Akashsangwan! Don't forget to share with your classmates and kindly subscribe ~ you can find all of my CS videos in this link: kzbin.info/aero/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC

[@mobeenQasim-yd7pb]

thank you so much!!!

[@QuocDatPhung]

You're welcome Mobeen Qasim! I'm glad you like my explanation! If you know anyone who needs help with this topic, 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: kzbin.info/aero/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC

[@Thiago-o7c]

Magnificient!

[@QuocDatPhung]

Thank you! 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: kzbin.info/aero/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC

[@kisuany]

you're incredible thank you so much for your videos! they are a great help :)

[@QuocDatPhung]

You're welcome Kisuany!! I'm really glad you enjoyed my video! I would really appreciate if you could share with your classmates or kindly subscribe ~ you can find all of my CS videos in this link: kzbin.info/aero/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC

[@algerr3952]

THANK YOUUUUU!!!!!

[@QuocDatPhung]

You're welcome Algerr! 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: kzbin.info/aero/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC

[@elaine3867]

Thank you!

[@QuocDatPhung]

You're welcome Elaine! 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: kzbin.info/aero/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC

[@RileyRudolfo]

Does Big Omega work the same as Big O, where if big Omega(n^2) and we are trying to prove 500n^2 + n log n. Would you change n log n to n^2 on the right hand side? You make great videos that are very easy to follow keep up the great work!

[@QuocDatPhung]

Thank you! I have a video on Big Omega in the playlist here: kzbin.info/aero/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC

[@Miushows]

you look very smart

[@QuocDatPhung]

Haha thank you! Please share with your classmates to help them in this course and also kindly subscribe ~ you can find all of my Computer Science videos in this link: kzbin.info/aero/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC

[@yilmaz349]

that was a great video, thank you! But i have a question. i have a square in my function. what i have to do in my first step? its like: 42n² √n.

[@QuocDatPhung]

You're very welcome! Can you clarify your question? You are trying to prove 42n² √n is big Omega of what?

[@yilmaz349]

@@QuocDatPhung Thank you for your Answer! Its about prooving BigO and Omega for this function: f (n) = 0.1n³ + 42n²√n + 10. I really appricate your help! O(n³)

[@darkofthunder34]

Where is the prove/disprove big Theta video?

[@DanielaMontavan]

du bist ein macher hawara

[@QuocDatPhung]

Wow, danke Daniela! Ich freue mich, dass dir meine Erklärung gefällt! Wenn du jemanden kennst, der Hilfe bei diesem Thema braucht, teile es bitte freundlich mit ihnen und abonniere auch, um mich zu unterstützen (es bedeutet mir viel) ~ du kannst alle meine CS-Videos unter diesem Link finden: kzbin.info/aero/PLeTO6OT3-FKmuxOu4RtupTay1yrMp6QGC