Time Complexity of Algorithms and Asymptotic Notations [Animated Big Oh, Theta and Omega Notation]#1
Рет қаралды 62,625
Time complexity is, the relation of computing time and the amount of input.
The commonly used asymptotic notations used for calculating the running time complexity of an algorithm are:
Big oh Notation (Ο)
Omega Notation (Ω)
Theta Notation (θ)
##### TIME COMPLEXITY SERIES #######
1. Time Complexity and Asymptotic Notation : kzfaq.info/get/bejne/mN6Xh6d_nsmaops.html
2. Logs and Summations for Time Complexity : kzfaq.info/get/bejne/jdijjbto2suWnmQ.html
3. Rules of Asymptotic Notations : kzfaq.info/get/bejne/hLSombaA2bXIYGg.html
4. Problems on Asymptotic Notations : kzfaq.info/get/bejne/brFkdq54stDTg2g.html
5. Time Complexity of Insertion, Bubble and Selection Sort : kzfaq.info/get/bejne/pst8hpCEl5m4pnk.html
Facebook: Codearchery
@premKumar-il1qy 3 жыл бұрын
From "2years ago" video to "2 hours ago" thanks for coming back to save our lives 🔥♥️
@moazelsawaf2000 3 жыл бұрын
What a great video ❤ You have taken just around 11 mins to well explain what my doctor in university took around 3.5 hours to explain! Thank you so much ❤
@DaBestAround 11 ай бұрын
Listen man, you are amazing. I have spent HOURS trying to understand what you explained in the first 4 minutes. God bless. Subscribed.
@mdbillalhosen4527 2 жыл бұрын
what great explanation you pictured simply.thank you so much.
@prasadmuthyala9625 3 жыл бұрын
After a longtime to see you sir,my second year b.tech I seen your videos on oops and other stuff .at that time because of you I can clearly understood the concepts Tq u sir for coming back....ur explanation and way of teaching is just awesome 👍😁
@poojasalvi1262 3 жыл бұрын
Your teaching is mind-blowing, awesome,easy to understand,love the way u teach,keep making vedio pls
@brindhad7787 3 жыл бұрын
I got selected in MNC company because of your Simple way of teaching technical concepts 🙏 Thanks a lot 🙏🙏🙏
@Codearchery 3 жыл бұрын
Glad to hear that. All the best Brindha D.
@brindhad7787 3 жыл бұрын
@@Codearchery Thank You Sir!
@aashikapoor789 2 жыл бұрын
Amazing video, beautifully explained such complex concepts.
@Englishsurge Жыл бұрын
Thank you, sir. 3 minutes in and I already understand what my textbook failed to make clear.
@yodahezerihunkassa160 Жыл бұрын
This video is very good. Your explanations were clear. Thanks!
@srinivasrahul2088 Жыл бұрын
I have watched many videos, but this is the best so far.
@manikanta-qi7yq 3 жыл бұрын
In average case upperbound the value of c must be 5 but you provide 4 for the c value which does not satisfy the condition when c=4 and n=1 apart from that video is excellent
@mangalgupta7039 2 жыл бұрын
C=4 and n>=2 will satisfy
@chefgb9183 2 жыл бұрын
omg Your explanation is very nice, simple and really understandable, thank you sooo much :)
@nishanath3019 3 жыл бұрын
Wow you are come back 😍 i just love your teaching style 😍☺️
@Nofani1 Жыл бұрын
that was really helpful thank you so much! 👍🏼👍🏼
@fantasy9960 2 жыл бұрын
thank you so much for this video! i love it a lot
@noohinaaz183 2 жыл бұрын
Hats off To ur explanation 👏🏻 Thnq Soooo much 😍😍
@mdshadan-7312 3 жыл бұрын
Good way to teach anything
@techfifer6137 3 жыл бұрын
Well demonstrated.....👌🏻
@pippallasiddu6738 2 жыл бұрын
loved it lot of work i know thanks bro
@krishnaji6541 3 жыл бұрын
After so long sir,i love the way you teach🙂
@Codearchery 3 жыл бұрын
Thanks a ton Priyanshi
@yusufalsh4203 3 жыл бұрын
thank you so much boss very helpfull
@sanskrutichavan3934 2 жыл бұрын
plz continue teaching i will enjoy
@jannatulferdouseesha7194 Жыл бұрын
Really helpful ,sir.😊
@aniemer1801 Жыл бұрын
Do we use these asymptotic notation for find and represent time complexity of worst,best and average case using big oh ,omega,Theta respectively
@shreemithranaveen479 2 жыл бұрын
😍Great explanation
@keshavgaur4535 3 жыл бұрын
Please sir upload a video to guide us that from where and how we can start competitive programming
@yerramachusreenu1197 3 жыл бұрын
By the animation remembering the concepts are very easy .so you chosen better teaching
@maneeta9207 3 жыл бұрын
Awesome🔥
@kunnudev7250 Жыл бұрын
Bro great awesome plx make more videos like this salute to you
@plusqueparfait6759 Ай бұрын
which is the time complexity of the following sequence? and why? int n, i, j, k, s=0; cin>>n; for(i=1; i
@ashraf6850 3 жыл бұрын
After long time video upload
@vishnu.s_ 2 жыл бұрын
Superb👌
@ankitkumar-tk7ks 2 жыл бұрын
Thanks 🙏🙏🙏
@SamratCharvak 3 жыл бұрын
Thanks bro 👍
@unicxogaming1140 3 жыл бұрын
You are best
@airzamzam5251 2 жыл бұрын
why do low rate of growth means best case (omega)?
@vaishnavireddy8282 3 жыл бұрын
Sir which software do you use?
@karthikkeys555 3 жыл бұрын
In which software u edited this viedo sir
@ashraf6850 3 жыл бұрын
I hope you are doing well and provide all skills
@Codearchery 3 жыл бұрын
Thanks a lot buddy :-)
@noorulainrana124 2 жыл бұрын
Thank yoy
@brindhad7787 3 жыл бұрын
Please upload more videos sir🙏🙏🙏🙏🙏
@manishshah120 2 жыл бұрын
Why don't youtubers add the refernces in the description?
@musicaLovee 5 ай бұрын
The best case complexity of any algorithm is always O(1)
@malcrack1 2 жыл бұрын
Pls Do DS/Algo And Python
@edumastergroup4129 5 ай бұрын
Can someone urgent help us? We have a task to solve related to this function Thanks
@Zeehan_Haider 2 жыл бұрын
Love from pakistan
@musicaLovee 5 ай бұрын
Big oh is the upperbound, big omega is lowerbound and big theta is tightbound. They don't correspond to worst case, best case and average case😢
@marconortje5764 3 жыл бұрын
ayo what the fuck
@manishpandey2852 Жыл бұрын
what do you mean by worst case time complexity is big o of n^2...? your explanation is absolutely wrong
@anianand9887 2 жыл бұрын
Though your teaching style is awesome, but the explanation is not correct.. we will not use Big oh as worst case , Omega as best case..Big oh or Omega or theta alone can be used for best, worst, average..
@remitheworst9085 Ай бұрын
Hey......I think you are confused... Let me explain it for you... Big O notation specifically describes the worst case scenario. It represents upper bound running time complexity of an algorithm.....
@manishpandey2852 Жыл бұрын
omg..... what a wrong explanation..... bro you need to be clear that worst case time complexity is not the upper bound. what do you mean by best case upper bound?