 |
 |
||
|
Shellsort Algorithm
|
|||
 |
|
Shellsort Algorithm
The main limitation of odd-even transposition sort is that it moves elements only one position at a time. If a sequence has just a few elements out of order, and if they are Ndistance from their proper positions, then the sequential algorithm still requires N2 time to sort the sequence. To make a substantial improvement over odd-even transposition sort, we need an algorithm that moves elements long distances. Shellsort is one such serial sorting algorithm.
Usage :
1) Enter the command line, and click on the "Command set?" button.
2) Click on the "Start" button
3) Use the "Faster" and "Slower" buttons to control the speed.
4) Use the "Single Step On/Off" button to toggle the single step mode, and use the "Step" button to go one step in the single step mode.
Parameters :
n number of data
(2^n ;n=1, 2, 3,....)
r range of data
p number of processors (upto 10)
m mode
0 - random data
1 - decreasing ordered data
