Calculating Time Complexity | Data Structures and Algorithms| GeeksforGeeks

🕰️ Ever wondered how to measure the efficiency of your algorithms? Join us on a journey into the world of time complexity, where we demystify the art of calculating algorithmic efficiency!

🧠 In this video, we break down the key concepts behind time complexity and provide you with a step-by-step guide to understanding and calculating it for your own code.

-------------------------------------------------------------------------

-------------------------------------------------------------------------

📖 Want to Learn more about Data Structures and Algorithms?

-------------------------------------------------------------------------

Follow us for more fun, knowledge, and resources:

Related Queries:
DSA course
Data Structures and Algorithms
DSA time complexity
Time complexity of algorithms
how to calculate time complexity of algorithms
time and space complexity
complexity analysis of algorithms

#timecomplexity #big-o #algortihms #DSA #datastructuresandalgorithms #gfg #geeksforgeeks #dsaalgorithms #datastructures #DSA #practicequestion #complexityanalysis

[michaelzumpano]

Bravo, that was the clearest yet most complete 8 min intro to complexity on YouTube. Hey, you found a good teaching algorithm - balance time and headspace efficiencies. Props.

[thembalamimsimango]

You explained ten times better than my lecturer did in just 8-minutes, thank you

[kevindsa]

After 4 years of Engineering in Computer Science this was the best explanation of Time Complexity thank you !!

[bhaskarnarayan]

You could also mention the complexities like O(logn), O(nlogn) etc. and the concepts of Master Theorem. It would be better.

[lakshmibonala]

How c1+c2n+c3n = O(n)?? Is it O(2n) by removing constants.

[WFi]

Incredible, I find myself at a loss for words to adequately express the precision and clarity of the elucidation.

[aleksandrakja]

You explained this misery better than my teacher ever could

[AV-mblv]

Explains O(1), O(n), O(n^2). Then says, "now let's look at the scale of diff. complexities O(1), O(log n), O(n), O(nlog n), O(n^2)"
Wait, where are the missing bits?
"Now you'll be able to calculate all time complexities of the algorithms"

[ankishgupta]

Perfect explanation...plzz upload more videos on complexities... 👌

[jhonbhai]

I was too much Dived into his Teaching .That I heard someone sparking gas Stove lighter at 1:34😂

[alekhyarao]

Excellent explanation and easy to understand. Thank you!

[WitchelsArtSchool]

best video explaining complexity. the complexity of complexity have been resolved here :D

[meowrice]

thanks! i finally understand bigO notations! the last part also is a big bonus for me. thank you!

[codecompass]

How is the sequential O(n)? Does it add up all together? I thought it should be O(2n)

[kmishy]

Simple and great content. I wonder how my prof taught

[Tauhid]

I appreciate your work. How about the for loops: for(i=1, i<=n){for(j=1, ?

[manishjoshi]

one doubt in sequence time complexity you described

c1 + c2 n + c3 n = BigO n time complexity ( doubt is after removing constant from equation why n + n is not 2n)

[jamesstark]

Thanks! this helped a lot for my CS 211 class.

[AhmedAli-kfwg]

I really appreciate the way you teach us. Thanks a lot sir : >)

[eceteamsioux]

Great efforts.
Thank you:)
Regards from USA