Princeton's Algorithms Course

This repository is inspired to Algorithms, Part I course of of Princeton University. More info can be found on the homepage of this course on Princeton University website adn the archive of the lectures for spring 2016.

I don't intend to provide the solutions of exercises or tests, but I want to replicate the approach used for Java algorithms in other programming languages (e.g. Ruby, Python, Perl, Haskell).

I hope you enjoy and feel free to fork to add other algorithms or languages.

Topics covered:

• 01. Union Find
• 01. Analysis of Algorithms
• 01. Percolation
• 02. Stacks and Queues
• 02. Elementary Sorts
• 03. Mergesort
• 03. Quicksort
• 04. Priority Queues