Implementation for the algorithms and datastructures taught in Coursera course - Design and Analysis of Algorithms, in Python

This repo contains code from both the classes 1 & 2 and is under progress. Code contains accompanying test code - doctests for few and full unittests for others

• Karatsuba Multiplication
• Basic Sorting
• Counting Inversions in an array
• Selecting ith order statistic in an array
• Graph datastructure (directed & undirected)
• Graph Algos
  • Topological Sorting
  • Shortest hops
  • DFS
  • BFS
  • Connected Components
  • Dijkstra's Shortest Path