Introduction to Algorithms Practice

Current Contents

collatz.py: A simple collatz conjecture.
merge-sort.py: An implementation of a merge sort algorithm.
bubble-sort.py: An implementation of a bubble sort algorithm.
closest-pair.py: An implementation of the closest pair problem
sieve.py: The sieve of eratosthenes, used to find all prime numbers below 10 million or so.

Name		Name	Last commit message	Last commit date
Latest commit History 6 Commits
README.md		README.md
bubble-sort.py		bubble-sort.py
closest-pair.py		closest-pair.py
collatz.py		collatz.py
merge-sort.py		merge-sort.py
sieve.py		sieve.py