Skip to content

Latest commit

 

History

History
84 lines (51 loc) · 7.76 KB

README.md

File metadata and controls

84 lines (51 loc) · 7.76 KB

logo

About this repository

This repository is meant to be a growing collection of interesting and useful algorithms implemented in Python and presented in IPython notebooks. IPython notebooks, because they offer a convenient way for describing the algorithm, benchmarking, maybe even visualization, and eventually sharing and viewing.

I am looking forward to your contributions, suggestions, and ideas

If you have any suggestions or want to make additions, I would be very happy if you could send me

  • an email,
  • leave me a message on google+,
  • or even send me a tweet on twitter (given you can fit it within the 140 character limit ;)).
  • Or even better: It would be great if you would simply fork this project and send me a pull request.


Categories

Algorithm Essentials

Greedy Algorithms

Divide-and-Conquer Algorithms

Other

Sorting Algorithms

Data Structures

Search Algorithms

Statistical Analysis

Machine Learning

Geometry

Efficiency