Struggle with Time Complexity? Watch this.
147.4 هزار بار بازدید -
4 سال پیش
-
In this video, I explain
In this video, I explain what is Time Complexity and how we can calculate Time Complexity of an algorithm or a data structure operation using various examples. I have explained why we calculate time complexity in Big O notation and why not in seconds, milliseconds or microseconds. You can see examples involving binary search, arrays and recursive algorithms. We also go through what do people mean by worst case time complexity.
In the first part of the video, we look at an algorithm with O(1) or constant time complexity. Then, we go through an algorithm with O(n) or linear time complexity and then an algorithm involving matrix or a 2-D array with O(n^2) or quadratic time complexity. Then, we look at how we achieve O(logn) or logarithmic time complexity in binary search.
Then, we look at a recursive algorithm where time complexity can be exponential. Although, we should avoid such time complexities but we still go through a recursion tree explaining how we can reach exponential time complexity.
We, then go through some common time complexities which one must remember to make it easy to select the best approach to solve the given problem.
Use my code THECODESKOOL to get 10 percent discount on any GeeksForGeeks course.
Get 20 percent discount on any Coding Ninjas course using this link - https://bit.ly/3MaMioY
Please subscribe to this channel for more such videos.
Feel free to comment below for any queries or doubts!
You can also reach me at:
Instagram:
Instagram: thecodeskool
Twitter:
Twitter: theCodeSkool
LinkedIn:
LinkedIn: deevankshu-garg-602501111
Music from: Video
In the first part of the video, we look at an algorithm with O(1) or constant time complexity. Then, we go through an algorithm with O(n) or linear time complexity and then an algorithm involving matrix or a 2-D array with O(n^2) or quadratic time complexity. Then, we look at how we achieve O(logn) or logarithmic time complexity in binary search.
Then, we look at a recursive algorithm where time complexity can be exponential. Although, we should avoid such time complexities but we still go through a recursion tree explaining how we can reach exponential time complexity.
We, then go through some common time complexities which one must remember to make it easy to select the best approach to solve the given problem.
Use my code THECODESKOOL to get 10 percent discount on any GeeksForGeeks course.
Get 20 percent discount on any Coding Ninjas course using this link - https://bit.ly/3MaMioY
Please subscribe to this channel for more such videos.
Feel free to comment below for any queries or doubts!
You can also reach me at:
Instagram:
Instagram: thecodeskool
Twitter:
Twitter: theCodeSkool
LinkedIn:
LinkedIn: deevankshu-garg-602501111
Music from: Video
4 سال پیش
در تاریخ 1399/08/24 منتشر شده
است.
147,457
بـار بازدید شده