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

[premKumar-ilqy]

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

[brindhad]

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

[manikanta-qiyq]

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

[moazelsawaf]

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.

[mdbillalhosen]

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

[poojasalvi]

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

[srinivasrahul]

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.

[krishnaji]

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

[prasadmuthyala]

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

[aashikapoor]

Amazing video, beautifully explained such complex concepts.

[yodahezerihunkassa]

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

[nishanath]

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

[noohinaaz]

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

[yerramachusreenu]

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

[chefgb]

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

[plusqueparfait]

which is the time complexity of the following sequence? and why?

int n, i, j, k, s=0;
cin>>n;
for(i=1; i<=n*n; i++)
{
for(j=1; j<=i/2; j++)
s+=i+j;

k=1;
while(k<j)
{
s+=k;
k*=2;
}
}
cout<<s;

[kunnudev]

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

[keshavgaur]

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