Algorithms

Core Algorithms from Princeton Coursera Course

This repository currently contains following Algorithms implementation:

1. Quick Find
2. Quick Union
3. Weighted Union
4. Weighted Union with path compression

Stack API

1. Stack using LinkedList
2. Stack using dynamically resizing array

Queue API

1. Queue using LinkedList
2. Queue using Dynamically resizing array

Percolation Problem This is a weighted union find implementation of famous percolation problem simulated on a n*n grid.