Computer Programming Algorithms Directory

[Bernard]

I'm building a Computer Programming Algorithms Directory (http://www.algosort.com/) and wondered if anyone here has some reference material they would like to contribute?

I'm trying to only list sites/pages that actually describe an algorithm or offer sample code showing an implementation. I'm not looking for pages that talk about algorithms without detailing them.

I'd also like to know if you have a suggestion for a class/type of algorithm that I haven't covered. I just started working on it, so I know it is far from comprehensive.

[Help Desk]

One can't forget about B-Trees (http://www.bluerwhite.org/btree/).

[Bernard]

I've added that site. Thanks!

[T0PS3O]

http://www.cise.ufl.edu/~mssz/GIS/GIS-prob3.html

Error Prediction Algorithm for Geographical Information Systems

There are tons of algo's used in GIS for shortest path and location-allocation problems but can't remember their names. B-Tree's are amongst them. Aren't there also C-Trees?

Point in polygon algorithm: http://www.geog.ubc.ca/courses/klink/gis.notes/ncgia/u33.html

Search for GIS algorithm and you'll find lots more.

[Bernard]

Thanks. I've added a category for that and included the resources you mentioned.

[Joel Naten]

Whenever discussing software algorithms, you should always include the godfather of algorithms (Donald Knuth) and his volume of books.

http://www-cs-faculty.stanford.edu/~knuth/taocp.html

[Bernard]

Thanks Joel, but that page does not describe any algorithms itself. It directs the reader to his books. I'm looking for on-line resources.

[wolfpack]

If you come across a description of the unshuffle-sort detailed enough to implment from, it'd be great. Meanwhile, how about: Random Filter (http://www.netfunny.com/rhf/jokes/91q1/randfilt.html)?

[Bernard]

LOL! Nice one Wolfpack.

[wolfpack]

Glad you liked it. Was serious about unshuffle-sort tho. It was invented in, I think around '85, and the guy says it's public domain, but I've never seen an online implementation or detailed description.

[Bernard]

I did some searching around and the NIST site mentions the magazine article that Mr. Kagel published it originally, but there is no good on-line description of it (that I could find):

Art S. Kagel, Unshuffle Algorithm, Not Quite a Sort?, Computer Language Magazine, 3(11), November 1985

http://www.nist.gov/dads/HTML/unshufflsort.html

[Nitin M]

I didn't see 2 classic game algorithms:

- Shortest Path Selection (lots of variations)
- Min/Max Move Selection (Alpha/Beta pruning variant would be nice)

[Bernard]

Shortest Path is also commonly called the Travelling Salesman in graphing. There are several links discussing solutions for the problem (including genetic algorithms). Check out the Stony Brook repository for the common graphing algos.

Check out the simulated annealing solutions for a twist on the min/max problem.