Graphed results for quicksort; Using the same implementation for quick sort in Java and C where possible. Please check the source and correct my mistakes and I'll happily rerun tests. http://lh4.ggpht.com/_EW60jqE5_B0/SjOyPADgxgI/AAAAAAAAAEs/axOOdHTNmq0/s800/Specs.png http://lh5.ggpht.com/_...

Implementation einer Reihe von Suchalgorithmen im Rahmen des Informatikstudiums Fach Algorithmen und Datenstrukturen

*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 w...

burstsort4j is a Java implementation of the [http://en.wikipedia.org/wiki/Burstsort burstsort] algorithm. There is an implementation of both the original Burstsort, which is quite fast but not particularly memory efficient, and the engineered Burstsort, which is extremely memory efficient and about ...

=== Introduction === There are some functions here such as language in _Java_ and _JavaScript_ which were writed by me, when I was free at work. There document of each of features has placed on the wiki. === File === The _algorithm-java_ is a librariy of _J2SE 1.5+_ platforms which has ViewS...

Just my random stuff.

C implementation of Quick-Sort. it uses last element as pivot. Both recursive and iterative version are implemented. The blog related to this is found at http://let-them-c.blogspot.com/2009/04/sorting-comparison-sort.html. email feedback kapildalwani@gmail.com

Didacticiel sur le tri rapide

Sorting-Algorithms is a project that I created in order to gather implementation of various sorting algorithms & compare performance of them, on the basis of "practical" data. with respect to the theoretical data. For example, we know that Quick sort is not really quick when we talk about the wor...

The motivation for building this library is speed with special emphasis on arrays of C numeric types. The usort libraries use a combination of strategies including bucket sort, radix sort, quicksort, and insertion sort. The speedups will vary depending on: size of the numeric type, size of th...