Skip to content

56phil/algorithms_in_ipython_notebooks

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

67 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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

About

A repository with IPython notebooks of algorithms implemented in Python.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Jupyter Notebook 100.0%