This prog contains a couple simplified sorting algrithms
- basic bubble
- basic linear
- basic shell
- basic merge
- basic quick
- pretty fast insert sort
- count sort (fastest sort with ints and longs. can be used with floats if they are small and rounded to a couple decimal places and then multiplied by 10^n to allow arrays to be redimed using them as the lower and upper bounds)
The prog is set up like a bench mark prog (for comparing different sorting algorithm speeds)
To use the prog:
>click "Generate"
>input a number like 10 000 000 (40 to 90 megs of ram)
>click "MEGA BENCH"
Then sit back and wait for the sorts to finish
This is program can be considered pretty much unfinished, but the sorts work.
This source is meant to aid people in learning about the concepts behind the different sorting algorithms, but the remarks don't go into too much detail for some, such as count, bubble, and linear.
There is also a recursive binary search, and a linear search.
Btw. On my 2.4 GHz comp count sort takes an average of 1 second to sort 10mill longs. Shell and quick take about 20-60 seconds.