Understanding Algorithm Time Complexity 📊

Just knowing the execution time of an algorithm is not a sufficient condition to determine its runtime. We still need to establish a way by which we can determine how the algorithm behaves with the size of the input set. This is known as Time Complexity. It defines the rate of growth of an Algorithm. Watch this video to know more about it and see live demo about the same.

00:00 - Introduction
00:31 - What do you mean by Time Complexity
03:30 - Real-life demo
06:35 - Calculate the Time Complexity
11:30 - Conclusion

📘 A text based explanation is available at: https://studyalgorithms.com/theory/what-is-the-time-complexity-of-an-algorithm/

🔗 Watch here, how to learn how time and space determine the quality of an algorithm: https://youtu.be/uLaFSQ9Ft2g

🔗 To see more videos like this, you can show your support on: https://www.buymeacoffee.com/studyalgorithms

💻 Get Social 💻
Follow on Facebook at: https://www.facebook.com/studyalgos
Follow on Twitter at: https://www.twitter.com/studyalgorithms
Follow on Tumblr at: https://studyalgos.tumblr.com/
Subscribe to RSS feeds: https://studyalgorithms.com/feed/

#algorithms #programming #tutorial