MIT6.006

This repository contains solutions to problems discussed in the lectures for the "Intro to Algorithms" course taught at MIT. The course material can be found here. The solutions to the algorithms presented in the lectures are shown as interactive notebooks in this repo. Happy learning!

Table of contents:

Introduction, asymptotic complexity

1. Algorithmic thinking, peak finding
2. Models of computation, document distance

Sorting

3. Sorting: Insertion, Merge Sort
4. Heaps, Heapsort
5. Binary Search Trees
6. Balanced BST, AVL Trees
7. Counting Sort, Radix Sort

Hashing

8. Hashing, Chaining
9. Table Doubling, Karp-Rabin
10. Open Addressing

Numerics

11. Integer Arithmetic, Newton's method
12. Multiplication, Division

Graph Search

13. Breadth-First Search (BFS)
14. Depth-First Search (DFS), Topological Sort

Shortest paths computation

15. Single-source shortest paths