Introduction to Programming and Algorithms (From Cse Cafe)
We will briefly talk about the importance of development, programming, algorithms, data structures, and then look deeper into algorithms and algorithm analysis. We will see what asymptotic analysis is and the importance of notations such as the Big-Oh notation. We will see how we can calculate the time complexity of an algorithm in terms of Big-Oh notation. We will see examples to make sure you have a good understanding of Big-Oh notation and can find the complexity of your programs easily. We will also derive O(log n) complexity with the help of an example.
Disclaimer: This session was originally uploaded to the CseCafe YouTube channel on September 8, 2021.