Skip to content

This contains solutions to problems discussed in the lectures for the "Intro to Algorithms" course. Video playlist for the course is available here: https://www.youtube.com/playlist?list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb

License

Notifications You must be signed in to change notification settings

shamikbose/MIT6.006

Repository files navigation

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

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

Hashing

  1. Hashing, Chaining
  2. Table Doubling, Karp-Rabin
  3. Open Addressing

Numerics

  1. Integer Arithmetic, Newton's method
  2. Multiplication, Division

Graph Search

  1. Breadth-First Search (BFS)
  2. Depth-First Search (DFS), Topological Sort

Shortest paths computation

  1. Single-source shortest paths

About

This contains solutions to problems discussed in the lectures for the "Intro to Algorithms" course. Video playlist for the course is available here: https://www.youtube.com/playlist?list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published