I hope you are enjoying this series with notes. Please like the video and share this course with everywhere as much as possible. This Data Structures and algorithms course is a part of my Data Structures and Algorithms playlist - th-cam.com/play/PLu0W_9lII9ahIappRPN0MCAgtOu3lQjQi.html Dont forget to bookmark it! Instagram - instagram.com/codewithharry
*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!
I am a physics student and studying programming in the quarantine, the content especially the math although seemed slow placed, are very interesting and fun to watch. I can literally watch your video for hours. I never thought one material can be so interesting for so many different students. Thanks a lot, sir.
Great content bro, ek request h please do adopt it. Competitive questions ki bhi practice karwa do. Kyunki test me wahi puchte hain. Theory baad me poochte hain. Suppose if you are teaching arrays then please also discuss probable coding questions around it. It will hardly take 5 more minutes but value of your videos will be increased 5X.
Also this one👇 Bohot se log hai jo comments bolte h ki aapne beech se kyu shuru padhana kiya to mein unse kanhna chahta hoon ki app youtube par mere channel par jaye. Yahan bohot sarri playlist available hain aur yeh hai iss course ki playlist. Ise yahan click kar ke bookmark kar le aur yaha click jarke save karle taki yeh playlist apki ho jaya.
really the best lecture on asymptotic notations on youtube. I have spent around 2 months on codechef and codeforces but still the concepts of these notations were not clear in my mind. Hats off to harry bhai!
🎯 Key Takeaways for quick navigation: 00:57 📚 Asymptotic notation is used to compare algorithms' efficiency. 02:20 📈 Big O notation (O) represents an upper time complexity bound. 08:27 📉 Big Omega notation (Ω) represents a lower time complexity bound. 13:33 📊 Big Theta notation (Θ) provides both upper and lower time complexity bounds. 16:00 🧮 Big Theta (Θ) implies Big O and Big Omega for the same function. 21:27 📈 Big-(Θ) notation defines a function f(n) as Θ(g(n)) if constants C1, C2, and n0 exist such that 0 ≤ C1g(n) ≤ f(n) and 0 ≤ f(n) ≤ C2g(n) for all n ≥ n0. 22:25 🧠 Report algorithm's runtime in big-(Θ), big-O, or big-(Ω) notation; big-(Θ) is preferred as it represents both upper and lower bounds. 24:19 📚 Comprehensive notes with clear graphs on big O, big Theta (Θ), and big Omega (Ω) help understanding and revision. 26:38 📝 Simplified mathematical definitions and graphical representations make understanding big O, big Theta (Θ), and big Omega (Ω) easier. 28:30 🎯 Always answer time complexity questions using big Theta (Θ) for a wider perspective; understand big O, big Theta (Θ), and big Omega (Ω) to stand out in interviews.
Bro. ap bohat acha kaam krte ho yar .......itne speed me video aati hai apki roj and vo bhi itna perfectly padate ho ki dimak me baith jata hai ..... God Blessed You Bro.
very thankful to Harry bhai @codewithharry.. I've learnt C, C++, HTML, CSS, JavaScript from CodeWithHarry, and now learning DSA.. THANK YOU sir or call it brother, being so frankly with everyone in the videos..
Thanks bro....I don't know the coincidence ...that I need these series for my ADA subject ...and you are now making it....thank you so much ..... Thanks for your hardworking towards us.....I will share this in my whole college ....we really need it..🙏 God bless you....so now please make whole series as soon as possible .🤗
Sir i really like your videos ..Now I am doing the Python and CSS Tutorials. Very interesting and your explanation is very clear.. Thank you.. Pls sir give me a heart and like..
Sir you are the best. Please don't stop giving free knowledge on the internet due to criticism of some dumb people. Ignore them . I know criticism hits harder than praise but sir the you are the best i ve no words to describe how great of a person you are .
Great harry brother...Apne itna accha expalin kiya mujhe ek hi bar me smj a gya.... because mujhe rarely hi itni jldi catch hota h..... superb explaination bro..... great deed.... You just exactly said the doubt and clear it that instantly came in my mind at that point of time
I will prepare for my internship interviews from your data structure playlist please complete the series sir. We are waiting and can u please make another series on competitive coding. Thankyou 💙💙♥️💙 u r the best
Bhaiya , you said ..alg alg colour se graph bnaya h 😅 i totally can understand your hardwork , your dedication and your love toward us 🙏 ye topic me mai 4 din se atkii huii thi , agr aaj smjh nhi aata to is pure topic ko skip hi kr deti , thanku
hm jaise student ka aap bhala kr diy ye series la kr...thanks a lot sir! best youtube channel ever...aap aise hi video late rhe or like subscribed ka tension mt lijiy hm sare vdo like nd share krte h dosto me...lots of love guruji:-)
Thank you bhaiya for such a wonderfull videos. Now I can clear my all doubts related to time complexity. I already know about TC but I wasn't so confident about this topic. But after watching your videos I m feel so confident. 😊
ab to harry bhai ko mathematics bhi sikhani chahiye....r a yaar itni asan sei itini saral vasa main kon sikhata hai bhai 🥲 apna harry bhai zindabaad..bro we need mathematics course for programmers and Computer science
really the best lecture on asymptotic notations on youtube. I have spent around 2 months on codechef and codeforces but still the concepts of these notations were not clear in my mind. Hats off to harry bhai!
Bhai regular book se smj nhi aa raha tha to u tube pe search kia aur dekha to sala he sab notations clear ho gaye, me din bhr wahipdh raha tha book me, aur prso he exam ab to pure marks lunga like aur subscribe kr diya
Sir you are great, sir you giving an opportunity to students to move forward, god bless you sir, thank you so sir ,there are so many people they work for money but the things you are doing for us is really amazing, great sir.
00:00 Understanding Big O notation 04:58 Mathematical definition of big O 09:32 Big O notation defines upper bound of algorithm complexity. 13:48 Understanding Big Omega notation 17:38 Understand the concept of big-(Θ) for best runtime representation 21:43 Understanding Big-(Θ), Big-(Ω) and Big-O Notations 00:24 Understand big-O, big-Theta, and big-Omega notation 29:26 Understanding Big O Notation Crafted by Merlin AI.
Harry Bhai Apse EK Request hai ....Please is series ko pause mt kriyegaa...Love your videos, Like before watching because of the content you provide us...Thank you so much harry bhai.🤘🤘🙏🙏❤❤
![เป็นไปได้ไหม - WanMai [Teaser] | 05-12-24](http://i.ytimg.com/vi/P5Uto6e453w/mqdefault.jpg)
I hope you are enjoying this series with notes. Please like the video and share this course with everywhere as much as possible.
This Data Structures and algorithms course is a part of my Data Structures and Algorithms playlist - th-cam.com/play/PLu0W_9lII9ahIappRPN0MCAgtOu3lQjQi.html
Dont forget to bookmark it!
Instagram - instagram.com/codewithharry
Harry bhai Arduino tut please and heart
Really appreciatable ❤️
Make tutorial on Java Programming.. Harry Bhai
Harry bhai first to comment on your text
💕 From karachi
*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!
Good work man !!
Damnn! I haven't even watched the video yet and i understood everything already. Great job bro !
We need more heroes like you ! ❤
good bro you simplify this stuff
Thank you
thank you for this
My man is W 🙏🏼
Me:data structures and algorithm are soo difficult ,i cant do it..
Harry bhae: aap chinta mat kriye hum krte hai praband..
We really appreciate your hard work and integrity....... For us harry..you're adding so much value in our programming life❤
Your hard work inspires us to work harder. Some teachers like you are like an angel for us.
Saw your comment on aman bhaiya's video too
Yes, you are absolutely correct.😌😌
Hi tanya
I am a physics student and studying programming in the quarantine, the content especially the math although seemed slow placed, are very interesting and fun to watch. I can literally watch your video for hours. I never thought one material can be so interesting for so many different students. Thanks a lot, sir.
I am a chemist :D
@@muhammadowais2873 chemist?!
Great content bro, ek request h please do adopt it. Competitive questions ki bhi practice karwa do. Kyunki test me wahi puchte hain. Theory baad me poochte hain. Suppose if you are teaching arrays then please also discuss probable coding questions around it. It will hardly take 5 more minutes but value of your videos will be increased 5X.
Valid point. Ds algo + qs to solve
Exactly
@BIKI yes beginners bhi join kr sakte he
Leetcode and CodeForces ke questions chahiye
Yes
* Some most common words in Harry Bhai's video
-->code
-->playlist
-->access
-->Shubham & Rohan 😂 *
Keyword
Rohan Das too😂
-> Computer screen
You forgot divya
Also this one👇
Bohot se log hai jo comments bolte h ki aapne beech se kyu shuru padhana kiya to mein unse kanhna chahta hoon ki app youtube par mere channel par jaye. Yahan bohot sarri playlist available hain aur yeh hai iss course ki playlist. Ise yahan click kar ke bookmark kar le aur yaha click jarke save karle taki yeh playlist apki ho jaya.
Harry bhai mai lockdown mai aapka python for beginners wala course kr rha hu. Aapne python bilkul aasaa trah se samjhai hai. Thank you harry bro ❤️
You are the man dude who changed my thought completely regarding data structure learning difficulty....thanks a lot...keep it up
A programmer with the heart of gold. Countless Indian students are indebted to you ❤️❤️❤️🙏
count pakistanis as well❣❣
Tho, I have completed B.Tech in EE, still I like watching your videos, thanks harry bhai for this simple explanation
What are doing now?
EEE student here as well 🙋♀️
@@edgbaston149 Civil
really the best lecture on asymptotic notations on youtube. I have spent around 2 months on codechef and codeforces but still the concepts of these notations were not clear in my mind. Hats off to harry bhai!
but harry bhaiya 3-4 times video ko dekh liya but asymptotic notation humko samajh hi nahi aarha hai
@@sujitrishikumar8621 ab to mai bhi bhul gya bhai 2 saal ho gye pdhe huye 😂😂
@@sush9889 🤣🤣
did you land any jobs though?
🎯 Key Takeaways for quick navigation:
00:57 📚 Asymptotic notation is used to compare algorithms' efficiency.
02:20 📈 Big O notation (O) represents an upper time complexity bound.
08:27 📉 Big Omega notation (Ω) represents a lower time complexity bound.
13:33 📊 Big Theta notation (Θ) provides both upper and lower time complexity bounds.
16:00 🧮 Big Theta (Θ) implies Big O and Big Omega for the same function.
21:27 📈 Big-(Θ) notation defines a function f(n) as Θ(g(n)) if constants C1, C2, and n0 exist such that 0 ≤ C1g(n) ≤ f(n) and 0 ≤ f(n) ≤ C2g(n) for all n ≥ n0.
22:25 🧠 Report algorithm's runtime in big-(Θ), big-O, or big-(Ω) notation; big-(Θ) is preferred as it represents both upper and lower bounds.
24:19 📚 Comprehensive notes with clear graphs on big O, big Theta (Θ), and big Omega (Ω) help understanding and revision.
26:38 📝 Simplified mathematical definitions and graphical representations make understanding big O, big Theta (Θ), and big Omega (Ω) easier.
28:30 🎯 Always answer time complexity questions using big Theta (Θ) for a wider perspective; understand big O, big Theta (Θ), and big Omega (Ω) to stand out in interviews.
This video cleared all my doubts regarding comparison of 2 or more algorithms based on their run time.
Thankyou for your efforts
Bro. ap bohat acha kaam krte ho yar .......itne speed me video aati hai apki roj and vo bhi itna perfectly padate ho ki dimak me baith jata hai ..... God Blessed You Bro.
Thanks
Waah yar
bruh
Till now - good going! Thank you for your efforts.
You have generated a trust that my career are in safe hands . Thank you very much!!
relatable
Aapki hard work ko salaam hai...kitna mehnat karte ho aap hamare liye... Thanks from the core of my heart.....
very thankful to Harry bhai @codewithharry.. I've learnt C, C++, HTML, CSS, JavaScript from CodeWithHarry, and now learning DSA.. THANK YOU sir or call it brother, being so frankly with everyone in the videos..
Maths is compulsory for learning DSA?
Areee bhai aap best ho maine c bhi yaha se sikhi c++ bhi or ab DS bhi yahi se seekh raha hu ❤️❤️❤️❤️❤️ love you bro
Thanks bro....I don't know the coincidence ...that I need these series for my ADA subject ...and you are now making it....thank you so much ..... Thanks for your hardworking towards us.....I will share this in my whole college ....we really need it..🙏 God bless you....so now please make whole series as soon as possible .🤗
Hat's off bro the way you explain things india need more educators like you . but you are the best among all teacher those i see till now.
Thank you Harry for such hard work......I know it's take time for you to make notes for us......we owe to you ❤️
Not much difficult the way yur teaching in simple method thts gud❤
already studied design analysis and algorithm in course syallbus lots of things get revised thank you sir
I haven't seen till now the way this man explaining each topic. Other makes even simple things more complicated.
Hey Harry I am from Pakistan I love the way you are teaching on this channel every possible topics about coding. Big Big thanks from me. ❣❣
Thank u bhai.....aisa content pure youtube pe kahi nhi hai
The best✨
You really transformed DSA into easy understandable language ✨
Thank you💫
Where are you
Sir i really like your videos ..Now I am doing the Python and CSS Tutorials. Very interesting and your explanation is very clear..
Thank you..
Pls sir give me a heart and like..
Thank you so much ♥️ sir 🙏
Kitna acha kaam kr rhe ho aap
Devta ho ap to 🙇🙇
Sir devmanus nikle 🥺🥺🥺
@@Apurb 🤣🤣
Sir you are the best. Please don't stop giving free knowledge on the internet due to criticism of some dumb people. Ignore them . I know criticism hits harder than praise but sir the you are the best i ve no words to describe how great of a person you are .
Thank you so much Sir, finally I understand these topics. Your hard work is really appreciable.
This guy is adding super value to students' lives👍. Thanks bhai
I am excitly waiting for new video of data structure,😍
Love you man
You are doing good job for us
Thanks a lot
First time I got a dil form him😉
@@studyhifit congratulations 👌😄
@@sumitbaghel7250 4 month se try kar raha tha bhai
Love bhai
Best mathematic explanation for Asymptotic notations in TH-cam.
I really appreciate your hard work, you deserve more subs and views
Finally finally... 😭Data structures & algorithms, I have no words for thanking you Harry Bhai.🙏
Thanks for the course sir, can't find any other explaining this much better for this topic, Yours is the best . :)
Thank you Harry for making video on DS and explaining it in very simple way
Harry sir is on 🔥
Harry broo live 10000000 years dil se dua de raha hu bhaiii just love itt yrrr apke jesa mentor kabhi nahi milega mujhee dilse thankyou buddyyy ❤️❤️❤️
Stunned to see your hard work sir. Thanks for providing such a quality education for free.
I wish you could upload 2 videos a day but still i am super excited for your daily video...keep up the good work
Bhaiya bus apke saath hai.....roz vedio dalna
We all really appreciate your efforts towards helping students giving them free but best courses!! Thank You Bhai❤️
Bs isi energy k sath aap padhaiye hm pdh rhe h ❤️
huge respect for u bhaiya, probably no one can teach this concept in a better way than you
Please ye playlist ke baad JAVA ke tutorial laane ka try krna na Harry bhai.
❤️❤️❤️
Great harry brother...Apne itna accha expalin kiya mujhe ek hi bar me smj a gya.... because mujhe rarely hi itni jldi catch hota h..... superb explaination bro..... great deed.... You just exactly said the doubt and clear it that instantly came in my mind at that point of time
I will prepare for my internship interviews from your data structure playlist please complete the series sir. We are waiting and can u please make another series on competitive coding. Thankyou 💙💙♥️💙 u r the best
Bhaiya , you said ..alg alg colour se graph bnaya h 😅 i totally can understand your hardwork , your dedication and your love toward us 🙏 ye topic me mai 4 din se atkii huii thi , agr aaj smjh nhi aata to is pure topic ko skip hi kr deti , thanku
Easy explanation in detail 💯
hm jaise student ka aap bhala kr diy ye series la kr...thanks a lot sir!
best youtube channel ever...aap aise hi video late rhe or like subscribed ka tension mt lijiy hm sare vdo like nd share krte h dosto me...lots of love guruji:-)
Thank you bhaiya for such a wonderfull videos. Now I can clear my all doubts related to time complexity. I already know about TC but I wasn't so confident about this topic. But after watching your videos I m feel so confident. 😊
I got All the points, Sir... Thank You!!
I had seen ur c programming videos bro
Ur teaching is really helpful
Keep it up bro
Have a great future ❤️❤️
Sir aapne ummid fir se jgadi algorithms sikh ne ki Thank you so much sir... 🙏
Really appreciable ,best notes world class notes 🔥🔥
bhai you are a great guy . jese apki batton se samajh mein ati hai na koi udemy mein paisa deke v nahi samajh mein nahi ata hain.
thank you sir. I hope I would crack software interview after this lectures
ab to harry bhai ko mathematics bhi sikhani chahiye....r a yaar itni asan sei itini saral vasa main kon sikhata hai bhai 🥲 apna harry bhai zindabaad..bro we need mathematics course for programmers and Computer science
Bahut bahut acche se smjh aa gya
😍😍😍
Maza aa gya yaar
Hello are u also preparing ds and algos
@@HarshKumar-nh6be yes
really the best lecture on asymptotic notations on youtube. I have spent around 2 months on codechef and codeforces but still the concepts of these notations were not clear in my mind. Hats off to harry bhai!
At 10:40 what does X and Y axis represent ?? Plz tell If u know
@@harshitachaurasia1246 are harry sir apke kch lgte he kya
another level of hard work and teaching skills,,,,u are one of the greatest teacher i ever seen my life
Sir, u r really doing a great job; looking forward to a competitive programming series after this!🧡🧡
Pls share notes???
Where is notes
1st view 1st comment , Great job Harry bhai , aise he jaldi jaldi DSA ki video laate rhiye ..... U r great
.. Thank u so much
Thank you for your amazing explanation and also for the notes sir! Blessed to find your playlist!😇
Can u plz tell me how can I download notes
@@SrishtiSingh-JNIS in description box
Thanks for providing notes and videos that are simple to understand
Really appreciate for your hard work 💯
Bhai notes kaha se Lena hai batao na
Bhai regular book se smj nhi aa raha tha to u tube pe search kia aur dekha to sala he sab notations clear ho gaye, me din bhr wahipdh raha tha book me, aur prso he exam ab to pure marks lunga
like aur subscribe kr diya
Thankyou so much sir....🥺,seriouslyno words for uhh😍
Thank you harry bhai . Ap ne hamerey kehne per yeh playlist bnai thank you.LOVE FROM PAKISTAN
Pls upload this course fast & before mid-august🙏
Your tutoring style is absolutely superb, sir!
Keep up the good work , you have amazing content and way of explaining is good for beginners
You are a blessing in this covid situation for the students who can't go to study centres
you are the ALAKH PANDEY for those students who want to make career in the field of technical education.
keep going sir.
Thank you sir. You have explained the asymptotic notations very beautifully and interestingly. Your notes are very easy to understand.
Great work Man. Please create a whole series on Data structures and Algorithms. ✌👍
Really isse best Desi Bhasa me kisi ne nahi padhaya abhi Tak🙏✌️👍♥️
Outstanding Sir Keep it Up :)
Sir you are great, sir you giving an opportunity to students to move forward, god bless you sir, thank you so sir ,there are so many people they work for money but the things you are doing for us is really amazing, great sir.
from my heart ❤
Completed 3rd video of the course.. Excited about course. Thanks a lot Harry. 🙏🙏
thank you for working so hard for us ❤️
Wow !!! You are legend in DSA . Thank you so much. ❤❤❤
Sir please make web development part2 and teach things like react, firebase, angularjs and tailwind css
thank harry bhaiya for each and every efforts for our betterment ...
Tusi great ho harry sir ji 😋😍😍😍😍😘🇮🇳🇮🇳🇮🇳😋😍😍😍😘
00:00 Understanding Big O notation
04:58 Mathematical definition of big O
09:32 Big O notation defines upper bound of algorithm complexity.
13:48 Understanding Big Omega notation
17:38 Understand the concept of big-(Θ) for best runtime representation
21:43 Understanding Big-(Θ), Big-(Ω) and Big-O Notations
00:24 Understand big-O, big-Theta, and big-Omega notation
29:26 Understanding Big O Notation
Crafted by Merlin AI.
Legend! 💕🔥🔥
Thank you very much bhai for making this knowledge available for free
this topic is so difficult for non-mathematic students.
YES I AM 9 Y/O
@@goodies1297 then you shouldnt be here buddy.
@@harshmishra1559 NOPE
How can we learn this then ?
Yes I am 13 y/o
Thanks for creating that kind of contents to make Life easy of those persons who are struggling in there software engineering career. 🙋
thank you,great.❤️
Please upload regularly continue this till the end of the course
Thank you for all the hard work that you are doing for us! :)
Harry Bhai Apse EK Request hai ....Please is series ko pause mt kriyegaa...Love your videos, Like before watching because of the content you provide us...Thank you so much harry bhai.🤘🤘🙏🙏❤❤
You should publish your own book, it'll sell like crazy.