python-algorithms

python-algorithms project is a collection of algorithms and datastructures implemented on Python3.6 You don’t need to install these project as a module (via pip) because usually you just need only one algorithm instead of all pack, so just copy and paste the source code. For easy navigation please use links to the source code below.

Algorithms:

Arithmetic

• GCD [Greatest Common Divisor]
• LCM [Least Common Multiple]

Greedy

• Covering segments
• Fractional knapsack

Search

• Binary search
• Closest pair
• Fibonacci [Recursive method]
• Fibonacci by Modulo [with Pisano period]
• Rabin-Karp algorithm

Sorting

• Merge sort
• Quick sort with [Dutch National Flag Algorithm] optimization

Algorithms on Graphs

• DFS (Depth first search)
• BFS (Breadth first search)
• Dijkstra (priority queue)
• Bidirectional Dijkstra (priority queues)
• Cycle detection (DFS)
• SCC (Strongly connected components)
• Topological Sort
• Bipartite
• Bellman-Ford algorithm (negative cycle detection)
• Kruskal algorithm for connecting points
• A* (potential function - euclidean distance)
• BST checker

Dynamic Programming

• Knapsack

Datastructures:

• Hash chain

Unsorted:

• Tree traversal methods (in/pre/post order recursive and iterative)
• Rope data structure (heavyweight strings based on splay tree with iterative in order traversal)