Cấu trúc dữ liệu và Thuật toán với Python

You’ll begin by learning what algorithms and data structures are. You will discover two data structures: linked lists and stacks. You will then learn how to calculate the complexity of an algorithm by using Big O Notation.

This second chapter will teach you the basics of queues, hash tables, trees, and graphs data structures. You will also discover what recursion is.

This chapter will focus on searching algorithms, like linear search, binary search, depth first search, and breadth first search. You will also study binary search trees and how to search within them.

This chapter will teach you some sorting algorithms, like bubble sort, selection sort, insertion sort, merge sort, and quicksort.