Implementations of Algorithms Covered in MIT 6.006

Topics Covered

• 1D and 2D Peak Finding (Lecture 1)
• Document Distance (Lecture 2)
• Insertion and Merge Sort (Lecture 3)
• Heap Sort (Lecture 4)

Lecture 1

Peak Finding (Lecture Details)

peakfinding.py(go to)

This program has implementations of algorithms for finding a peak in a 1-D and 2-D array of integers.

Lecture 2

Document Distance (Lecture Details)

docdist.py(go to)

This program calculates document distance between two files efficiently(doclist8).

Lecture 3

Insertion and Merge Sort (Lecture Details)

ins-merge-sort.py(go to)

Implementation of insertion and merge sort algorithms.

Lecture 4

Heap Sort (Lecture Details)

heapsort.py(go to)

Implementation of heap sort algorithm.