From 2804712a0a06c7cbcaf6614b28b61b854968efbb Mon Sep 17 00:00:00 2001 From: Karan Goel <karan@goel.im> Date: Tue, 27 Aug 2013 14:28:52 +0530 Subject: [PATCH] Add some classic algo problems --- Classic Algorithms/README.md | 8 +++++++- README-scratch.md | 8 +++++++- README.md | 6 ++++++ 3 files changed, 20 insertions(+), 2 deletions(-) diff --git a/Classic Algorithms/README.md b/Classic Algorithms/README.md index e4ab0afbc..bd88e10d6 100644 --- a/Classic Algorithms/README.md +++ b/Classic Algorithms/README.md @@ -1,4 +1,10 @@ Classic Algorithms ----------------- -**Collatz Conjecture** - Start with a number *n > 1*. Find the number of steps it takes to reach one using the following process: If *n* is even, divide it by 2. If *n* is odd, multiply it by 3 and add 1. \ No newline at end of file +**Collatz Conjecture** - Start with a number *n > 1*. Find the number of steps it takes to reach one using the following process: If *n* is even, divide it by 2. If *n* is odd, multiply it by 3 and add 1. + +**Sorting** - Implement two types of sorting algorithms: Merge sort and bubble sort. + +**Closest pair problem** - The closest pair of points problem or closest pair problem is a problem of computational geometry: given *n* points in metric space, find a pair of points with the smallest distance between them. + +**Sieve of Eratosthenes** - The sieve of Eratosthenes is one of the most efficient ways to find all of the smaller primes (below 10 million or so). diff --git a/README-scratch.md b/README-scratch.md index 224bc73ae..7d5c026b1 100644 --- a/README-scratch.md +++ b/README-scratch.md @@ -44,7 +44,13 @@ Classic Algorithms ----------------- **Collatz Conjecture** - Start with a number *n > 1*. Find the number of steps it takes to reach one using the following process: If *n* is even, divide it by 2. If *n* is odd, multiply it by 3 and add 1. - + +**Sorting** - Implement two types of sorting algorithms: Merge sort and bubble sort. + +**Closest pair problem** - The closest pair of points problem or closest pair problem is a problem of computational geometry: given *n* points in metric space, find a pair of points with the smallest distance between them. + +**Sieve of Eratosthenes** - The sieve of Eratosthenes is one of the most efficient ways to find all of the smaller primes (below 10 million or so). + Graph -------- **Graph from links** - Create a program that will create a graph or network from a series of links. diff --git a/README.md b/README.md index f901e150d..67514b593 100644 --- a/README.md +++ b/README.md @@ -88,6 +88,12 @@ Classic Algorithms [**Collatz Conjecture**](https://github.com/thekarangoel/Projects/blob/master/Classic%20Algorithms/collatz.py) - Start with a number *n > 1*. Find the number of steps it takes to reach one using the following process: If *n* is even, divide it by 2. If *n* is odd, multiply it by 3 and add 1. +**Sorting** - Implement two types of sorting algorithms: Merge sort and bubble sort. + +**Closest pair problem** - The closest pair of points problem or closest pair problem is a problem of computational geometry: given *n* points in metric space, find a pair of points with the smallest distance between them. + +**Sieve of Eratosthenes** - The sieve of Eratosthenes is one of the most efficient ways to find all of the smaller primes (below 10 million or so). + Graphs ---------