L-1.3: Asymptotic Notations | Big O | Big Omega | Theta Notations | Most Imp Topic Of Algorithm

🚀 Enroll Now in GATE DA exam course 2025🌟
💰Course Price: 2999/- (Non-Refundable)
🕒Course starting Date: 5th March 2024
📞 Contact us:
For any queries or assistance, feel free to reach us on WhatsApp or call at 8295451354.
🕒Validity of Course: 31st March, 2025

►Design and Analysis of algorithms (DAA) (Complete Playlist)::

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:

[aerodynamico]

The best teachers do not necessarily bring doctorates; they bring an infectious enthusiasm. It also helps greatly if they are close in age to their target audience. More power to your teaching, young man!

[sangeetsachdeva]

Wow sir. Your 14 minutes lecture is much helpful than the ppt of 14 pages I was studying provided by college.

[AnilKumar-veyl]

wtf i didn't understand asymptotic notation in my college in whole 3 years and now after watching 14 minute everything is clear .It's magic

[hritikapal]

Whole sem i didn't got this topic but in 14 min it's all done now. INCREDIBLE! 😊
Thankyou so much sir for the finest explanation 🙌🏻💯

[syedihsanshah]

U are a blessing for a confused students like us....ur way of teaching is just amazing

[swathip]

Sir, You are 'THE BEST TEACHER(GURU)'. Aapki punjabi accent wali hindi mujhe bahut acchi lagti hai🤩...It helps me to learn the concepts much better. I love your style & way of teaching. Bahut chote bacche bhi samjne lag jaayenge, utni acchi teaching hai aapki. Thank you soo much for motivating lakhs of students sir. Whenever I listen to your video I never end it without giving a like. 🙏😍

[milan_]

Finally !!!!🔥🔥🔥 After your 14 min video, I have completely understood this all notations.
After 1 year I will be able to solve Asymptotic notations. All doubts regarding this topic are now clear....
Great Explaination...👌👌👌😍
THANKKK YOUUU SOOOO SIR 🤘🤘🤘👏👏👏

[SaiSantoshPal]

Let's simplify things.
Asymptotic notation is like a tool that helps us compare how fast different computer programs can solve problems as the problems get bigger and bigger.


Imagine you have two superheroes, SuperFastMan and SuperSlowMan, and they both want to solve a puzzle. The puzzle has different levels, and as they go to higher levels, the puzzle becomes bigger and more challenging.

1. Big O notation (O):
Let's say SuperFastMan can solve a puzzle in no more than 5 minutes, no matter how big it is. We write this as O(5 minutes). It means his speed to solve the puzzle is like a "speed limit" or an "upper bound."

Example: O(5 minutes) means that the time it takes to solve the puzzle is never worse (never longer) than 5 minutes, no matter how big the puzzle is.

2. Omega notation (Ω):
Now, let's consider SuperSlowMan, who takes at least 10 minutes to solve a puzzle, no matter how small it is. We write this as Ω(10 minutes). It means his speed to solve the puzzle is like a "slowest speed" or a "lower bound."

Example: Ω(10 minutes) means that the time it takes to solve the puzzle is never better (never shorter) than 10 minutes, no matter how small the puzzle is.

3. Theta notation (Θ):
Finally, let's talk about a third superhero, SuperAverageMan, who always takes around 7 minutes to solve the puzzle. We write this as Θ(7 minutes). It means his speed to solve the puzzle is like a "best guess" or an "average speed."

Example: Θ(7 minutes) means that the time it takes to solve the puzzle is neither worse nor better, but it's around 7 minutes, no matter how big or small the puzzle is.

These notations help computer programmers decide which superhero (algorithm) is the best for a specific puzzle (problem) based on their speed (efficiency) for large puzzles (big data).

So, when programmers talk about Big O, Omega, and Theta notation, they are just comparing superheroes' abilities to solve puzzles of different sizes!

[sriramsridhara]

literally the best video!

my professors keep talking for 50 minutes talking all nonsense over the course of several lectures. but summarized the main points in such a short video.

[alliedvssoviet]

14 minutes are much better than regular 1 hours class. Thankyou so much, really helpful Sir

[pawankumargupta]

You did a really good job. Thank you for taking time to do this. Helped me understand in one go. :)

[anuhuyawr]

Seriously Sir g your lectures are life saving...…They helped me a lot …..Thank you so much

[shadatitus]

sir, please teach on topics like time complexity, space complexity in DAA. because you are the only teacher who explains every topic in a simple, easy and clear way.

[jahnavisingh]

You are amazing.... I have never seen such an amzing teacher... Thank you sir for giving all these lectures free on youtube...
Lots of love and respect

[fahimirfanalam]

I came across of your other videos which were in English and I realized how amazing you are in explaining difficult concepts. Therefore, please consider teaching in English so that the international audience can be benefited too.

[shreyanmukherjee]

00:02 Asymptotic notation represents time complexity mathematically.
02:10 Understanding Asymptotic Notations and Big O notation
04:29 Quadratic function dominates over linear function for larger values of n.
06:15 Big O notation represents the upper bound of an algorithm's performance.
07:56 Explaining Big O and Big Omega notations in algorithm analysis
09:37 Asymptotic Notations - Big Omega
11:05 Understanding Big Omega, Big Theta, and their representations
12:50 Asymptotic notations - big O, big omega, and theta are crucial for analyzing algorithm complexity.

[bhavnasen]

Much respect to you Fantastic way of explaining the concepts!!!

[devchirag]

Your teaching style is very unique sir, thanks for helping all the students who understand concepts better in hindi than english.

[muskansoni]

After watching your video I just wanted to say only one word -"Amazing"👏🏻 Thank you so much sir 🌼

[rahulnayak]

seen lot of videos, no one explained better than you sir. Respect.