If we sort the data clumsily, we must compare two data n(n+1)/2 times to
check their order (where n is the total of the data). Taking some smarter
methods for sort, we can reduce the order of conparisons into n log n. Now
this method can reduce the order of comparisons into almost n (precisely
less than n log (log n) )without huge additional memories such as bin sort,
namely this sort is quicker than any other sorts which have the order of
comparisons n log n such as bubble sort or quick sort! ---really?
Why don't you see the simulation of the sort if you think I'm attempting to
deceive you? You can enjoy the animation of sorting process on the display.
Use: PC(486DX), Windows95, IE(ver.3.0)
Caution: This is unauthorized ActiveX.
(Sorry, it's not available on Netscape.)
http://www.cia.com.au/rad/quicker.htm
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://iubio.bio.indiana.edu/bionet/mm/bio-soft/attachments/19980907/ce0659e3/attachment.html
