Sorting Arrays

[barok]

i read the first 5 posts or so then skimmed through the rest, so i'm not quite too sure about what everyone else is saying... but i found some things on other sorting algos...

http://www.answers.com/main/ntquery?meth...tab=2222_1

it doesn't really name a fastest, but it has a few on there...

Microsoft's "Quick" programming languages (such as QuickBASIC and QuickPascal) have a file named "sortdemo" (with extension BAS and PAS for QB and QP, respectively) in the examples folder that provides a graphical representation of several of the various sort procedures described here, as well as performance ratings of each.

::EDIT::

okay, you guys got me intrigued by sorting algorithms. might start experimenting with them tomorrow... i spent about 20 minutes and found a few algorithms that are allegedly fast.

Merge sort: http://www.answers.com/main/ntquery?meth...tab=2222_1
heap sort: http://www.answers.com/main/ntquery?meth...tab=2222_1
smooth sort: http://www.answers.com/main/ntquery?meth...tab=2222_1
introsort: http://www.answers.com/main/ntquery?meth...tab=2222_1

:::Last Edit:::

found sortdemo... ran it and saved the results.

Download SORTDEMO.BAs[/code]