Algorithms-Design-and-Analaysis

Python and Java Implementation of Algorithms presented in Stanford's "Algorithms: Design and Analysis" course. The following Algorithms and Datastructures have been implemented:

Python and Cython

• Merge Sort and related algorithms
• Quicksort and related algorithms
• Contraction algorithm for minimum cut problem (Graphs)
• Dijkstra's algorithm (heap based)
• Breadth-first search
• Depth-first search
• Computation of strongly connected components in directed Graphs
• Las Vegas median finding

C++

• Fibonacci Heap
• Kruskal using Union-Find forest
• Kruskal using Fibonacci Heap

Java

• Hash Table
• Bloom Filter