# Learning Outcomes

A brief summary of what you would learn in this course

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

Let’s dive right into it!