https://github.com/prakhar1989/Algorithms

:computer: Data Structures and Algorithms in Python
https://github.com/prakhar1989/Algorithms

Last synced: about 1 month ago
JSON representation

:computer: Data Structures and Algorithms in Python

• Host: GitHub
• URL: https://github.com/prakhar1989/Algorithms
• Owner: prakhar1989
• License: wtfpl
• Created: 2012-12-11T05:33:04.000Z (over 11 years ago)
• Default Branch: master
• Last Pushed: 2021-08-03T04:59:43.000Z (almost 3 years ago)
• Last Synced: 2024-04-10T21:07:48.917Z (about 1 month ago)
• Language: Python
• Homepage:
• Size: 131 KB
• Stars: 3,005
• Watchers: 148
• Forks: 829
• Open Issues: 52
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Lists

• awesome-algorithms - by @prakhar1989
• awesome-algorithms - by @prakhar1989
• awesome-stars - prakhar1989/Algorithms
• awesome-stars - prakhar1989/Algorithms - :computer: Data Structures and Algorithms in Python (Python)
• awesome-algorithms - by @prakhar1989
• awesome-algorithms - by @prakhar1989
• awesome-stars - prakhar1989/Algorithms - `★3009` :computer: Data Structures and Algorithms in Python (Python)
• awesome-stars - prakhar1989/Algorithms - :computer: Data Structures and Algorithms in Python (Python)

README

        
Algorithms in Python

======

Implementations of a few algorithms and datastructures for fun and profit!

Completed

---

- Karatsuba Multiplication

- Basic Sorting

- Rabin-Miller primality test

- Sieve of Eratosthenes for prime numbers

- Binary Search

- 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 - O(mlogn)

    - Prim's Minimum Cost Spanning Tree - O(mlogn)

    - Kruskal's Minimum Spanning Tree - O(mlogn)

    - Max k Clustering

    - Bellman Ford

    - Floyd Warshall

    - Johnson's Algorithm

- Heap datastructure

	- Max heaps

	- Min heaps (priority queue)

	- Heapsort

- Job Scheduling

- [UnionFind](http://en.wikipedia.org/wiki/Disjoint-set_data_structure) Data Structure

- Binary Search Tree

- Kandane's Algorithm

- Knapsack Problem (0/1 and unbounded)

- Longest Increasing Subsequence

- Longest Common Subsequence

- Prefix Tries

- Stack ADT (with example problems)

  - String Reverse

  - Parenthesis Matching

  - Infix to Postfix

- Modular exponentiation

- Modular multiplicative inverse

Tests

---

    python -m tests.graph_test

    python -m tests.digraph_test

    python -m tests.graph_algorithms_test

    python -m tests.heap_test

    python -m tests.unionfind_test

    python -m tests.singly_linked_list_test

    python -m tests.modular_exponentiation_test

    python -m tests.modular_multiplicative_inverse_test