Python Algorithms

Course notes and select Python implementations of a few basic algorithms based on the Coursera Princeton Intro to Algorithms I course. The course is taught in Java, so some of the issues raised in the notes are Java-specific, or not necessarily applicable to Python. All notes and code are contained in Jupyter notebooks.

Contents

0. How to Analyze Algorithms
1. Union Find
2. Stacks and Queues
3. Elementary Sorts
4. Mergesort
5. Quicksort
6. Priority Queues and Heapsort
7. Elementary Symbol Tables and Binary Search Trees
8. Balanced Search Trees
9. Hash Tables
10. Symbol Table Applications