Learning Outcomes

What will you learn?

In this course, you will learn about:

• Measuring time complexities of algorithms

• Brute force algorithms

• Searching and sorting in different data structures

• The dynamic programming technique to efficiently solve problems

• Greedy algorithms

• The divide and conquer method, i.e., solving multiple subparts of a problem to solve the bigger problem

• Graphs, graph traversals, and other important graph algorithms

---

Let’s dive right into it!