 |
 |
||
|
Quicksort
Algorithm
|
|||
 |
|
Quicksort Algorithm
Quicksort is a divide-and-conquer algorithm that sorts a sequence by recursively dividing it into smaller subsequences. Sorting the smaller arrays represents two completely independent subproblems that can be solved in oparallel. Therefore, one way to parallelize wuicksort is to execute it initially on a single processor; then when the algorithm performs its recursive calls, assign one of the subproblems to another processor. Now each of these processors sorts its array by using quicksort and assigns one of its subproblems to other processors. The algorithm terminates when the arrays cannot be further partitioned.
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
r range of data
p number of processors (upto 10)
m mode
0 - random data
1 - decreasing ordered data
