|
Project Information
Members
Links
|
JALDS ( J ava AL gorthms and D ata S tructures) pronounced JAL-DOES is an open source repository that contains a variety of algorithms and data structures that you can use in your own code, including graphs , trees , sorting- algorithms and much more. Motivation : Have you ever wondered, "What is the best sorting algorithm I should use with this data?" , Well the only person who can answer that question is .... YOU. You know your data better than anyone else! And this project can help you experiment and choose the best one. Graphs, graphs are everywhere eg: Social Networks, Web Pages ... JALDS contains graph algorithms and data structures that you can reuse in your own projects. Should you use a Binary Tree for sorting ever thing ? not necessarily a regular binary tree will be fast only if you insert elements in a random order, can you guarantee that you will be inserting elements in random order ? Your other option is to use a RedBlack tree, that will guarantee that the tree is balanced but you pay an overhead for that. Bubble Sort is the worst sort but easiest to implement, did you know there is a Comb Sort that is a very slight variation of Bubble Sort (hence easy to implement) but rivals complex sorts such as Quick Sort and Merge Sort in speed ? Some of these Sorting algorithms are Stable (keeps the original order of keys, if two key have the same value), online (all keys need not be provided at the beginning) and off-line. If you wanted to compare a variety of algorithms and pick the best one, (and not just rely on the stuff that comes in the JDK) then this project is for you. Having many options is a good thing. This project aims to put all of these algorithms and its implementations in one easy spot for everyone to access, read and re-use. News Aug 27th 2008
|
|