Get startedGet started for free

Congratulations!

1. Congratulations!

Congratulations! You have made it to the end of the course. Let's review what you learned!

2. Chapter 1

In Chapter 1, you learned what algorithms and data structures are. You discovered linked lists and stacks. You also learned how to calculate the time complexity of an algorithm by using Big O Notation.

3. Chapter 2

Chapter 2 taught you the basics of queues, hash tables, trees, and graphs data structures. You also discovered what recursion is.

4. Chapter 3

Chapter 3 focused on searching algorithms. You discovered linear search, binary search, depth first search, and breadth first search. You also studied binary search trees and how to search within them.

5. Chapter 4

In this final chapter, you learned some sorting algorithms, like bubble sort, selection sort, insertion sort, merge sort, and quicksort.

6. Thank you!

Thank you very much for your time! I hope you enjoyed this course and that the content will help you with your interviews or your job.