Skip to content
Algorithms implemented in Python
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Type Name Latest commit message Commit time
Failed to load latest commit information.
algorithms Quicksort. Nov 30, 2015
MANIFEST initial commit Nov 23, 2010 Quicksort. Nov 30, 2015 PEP8. Nov 20, 2015 update pkg setup Dec 20, 2010

Python Algorithms Library

Laurent Luce


The purpose of this library is to help you with common algorithms like:

A* path finding.

Binary tree

  • lookup.
  • insert.
  • delete.
  • compare 2 trees.
  • print tree.
  • tree inorder generator.

String Matching

  • Naive.
  • Rabin-Karp.
  • Knuth-Morris-Pratt.
  • Boyer-Moore-Horspool.


  • Convert string to integer without using int on the full string.
  • Reverse string containing words.


  • Permutations.


  • Subset with highest sum.
  • Find integer in sorted list.
  • Merge sort.
  • Quicksort.


Get the source and run

$ python install


The Python Algorithms Library is distributed under the MIT License

You can’t perform that action at this time.