Learning Outcomes
Explore the core learning outcomes of this course, including major algorithmic paradigms and techniques like time complexity measurement, searching and sorting, graph traversals, greedy algorithms, dynamic programming, and divide and conquer. Understand how these concepts apply to solving coding interview challenges with C++.
We'll cover the following...
We'll cover the following...
In this course, you will learn about:
- Major algorithmic paradigms
- Measuring time complexities of algorithms
- Searching and sorting in different data structures
- Graphs, graph traversals, and other important graph algorithms
- Greedy Algorithms
- The dynamic programming technique to efficiently solve problems
- The Divide and Conquer method, i.e. solving multiple subparts of a problem to solve the bigger problem