Skip to content

Commit

Permalink
Update README.md
Browse files Browse the repository at this point in the history
  • Loading branch information
@dbonadiman
dbonadiman committed Sep 4, 2013
1 parent 52949a3 commit 434c867
Showing 1 changed file with 0 additions and 2 deletions.
2 changes: 0 additions & 2 deletions Classic Algorithms/README.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -8,5 +8,3 @@ Classic Algorithms
**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).

**Inverted index** - An [Inverted Index](http://en.wikipedia.org/wiki/Inverted_index) is a data structure used to create full text search. Given a set of text files, implement a program to create an inverted index. Also create a user interface to do a search using that inverted index which returns a list of files that contain the query term / terms. The search index can be in memory.

0 comments on commit 434c867

Please sign in to comment.