Time Complexity of Algorithms and Asymptotic Notations [Animated Big Oh, Theta and Omega Notation]#1

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 : • Time Complexity of Alg...
2. Logs and Summations for Time Complexity : • Logarithm and Summatio...
3. Rules of Asymptotic Notations : • Asymptotic Analysis Ru...
4. Problems on Asymptotic Notations : • Problems on Asymptotic...
5. Time Complexity of Insertion, Bubble and Selection Sort : • Time Complexity Analys...
Facebook: / codearchery

[@premKumar-il1qy]

From "2years ago" video to "2 hours ago" thanks for coming back to save our lives 🔥♥️

[@brindhad7787]

I got selected in MNC company because of your Simple way of teaching technical concepts 🙏
Thanks a lot 🙏🙏🙏

[@Codearchery]

Glad to hear that. All the best Brindha D.

[@brindhad7787]

@@Codearchery Thank You Sir!

[@manikanta-qi7yq]

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]

C=4 and n>=2 will satisfy

[@moazelsawaf2000]

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]

Listen man, you are amazing. I have spent HOURS trying to understand what you explained in the first 4 minutes. God bless. Subscribed.

[@mdbillalhosen4527]

what great explanation you pictured simply.thank you so much.

[@poojasalvi1262]

Your teaching is mind-blowing, awesome,easy to understand,love the way u teach,keep making vedio pls

[@srinivasrahul2088]

I have watched many videos, but this is the best so far.

[@Englishsurge]

Thank you, sir. 3 minutes in and I already understand what my textbook failed to make clear.

[@krishnaji6541]

After so long sir,i love the way you teach🙂

[@Codearchery]

Thanks a ton Priyanshi

[@prasadmuthyala9625]

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 👍😁

[@aashikapoor789]

Amazing video, beautifully explained such complex concepts.

[@yodahezerihunkassa160]

This video is very good. Your explanations were clear. Thanks!

[@nishanath3019]

Wow you are come back 😍 i just love your teaching style 😍☺️

[@noohinaaz183]

Hats off To ur explanation 👏🏻
Thnq Soooo much 😍😍

[@yerramachusreenu1197]

By the animation remembering the concepts are very easy .so you chosen better teaching

[@chefgb9183]

omg Your explanation is very nice, simple and really understandable, thank you sooo much :)

[@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

[@kunnudev7250]

Bro great awesome plx make more videos like this salute to you

[@sanskrutichavan3934]

plz continue teaching i will enjoy

[@keshavgaur4535]

Please sir upload a video to guide us that from where and how we can start competitive programming

[@mdshadan-7312]

Good way to teach anything

[@ashraf6850]

I hope you are doing well and provide all skills

[@Codearchery]

Thanks a lot buddy :-)

[@shreemithranaveen479]

😍Great explanation

[@Nofani1]

that was really helpful thank you so much! 👍🏼👍🏼

[@jannatulferdouseesha7194]

Really helpful ,sir.😊

[@fantasy9960]

thank you so much for this video! i love it a lot

[@yusufalsh4203]

thank you so much boss very helpfull

[@techfifer6137]

Well demonstrated.....👌🏻

[@ashraf6850]

After long time video upload

[@pippallasiddu6738]

loved it
lot of work i know
thanks bro

[@vishnu.s_]

Superb👌

[@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

[@ankitkumar-tk7ks]

Thanks 🙏🙏🙏

[@unicxogaming1140]

You are best

[@maneeta9207]

Awesome🔥

[@musicaLovee]

The best case complexity of any algorithm is always O(1)

[@manishshah120]

Why don't youtubers add the refernces in the description?

[@SamratCharvak]

Thanks bro 👍

[@brindhad7787]

Please upload more videos sir🙏🙏🙏🙏🙏

[@noorulainrana124]

Thank yoy

[@Zeehan_Haider]

Love from pakistan

[@vaishnavireddy8282]

Sir which software do you use?

[@airzamzam5251]

why do low rate of growth means best case (omega)?

[@musicaLovee]

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😢

[@edumastergroup4129]

Can someone urgent help us? We have a task to solve related to this function
Thanks

[@karthikkeys555]

In which software u edited this viedo sir

[@malcrack1]

Pls Do DS/Algo And Python

[@anianand9887]

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.....

[@gurucharan7034]

Yes , what you said is correct, be it any case (best or worst) , we can use any Notation to describe any case.

[@manishpandey2852]

what do you mean by worst case time complexity is big o of n^2...? your explanation is absolutely wrong

[@marconortje5764]

ayo what the fuck

[@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?