![]() |
QuickSortLast updated: January 19, 2003 |
![]() |
QuickSort is a generic implementation of C.A.R Hoare's Quick Sort algorithm which operates on integer arrays.
The data size for the execution was 40000.
| From | To | Value |
|---|---|---|
| 8 | 8 | 0.005 |
| 16 | 16 | 0.138 |
| 24 | 24 | 0.327 |
| 32 | 32 | 0.080 |
| 40 | 40 | 0.088 |
| 48 | 72 | 0.244 |
| 80 | 136 | 0.069 |
| 144 | 392 | 0.038 |
| 400 | +Inf | 0.011 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 0.975 |
| 2 | 2 | 0.023 |
| 3 | +Inf | 0.002 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 0.985 |
| 2 | 2 | 0.012 |
| 3 | +Inf | 0.002 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 0.951 |
| 2 | 2 | 0.019 |
| 3 | +Inf | 0.020 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 0.965 |
| 2 | 2 | 0.005 |
| 3 | +Inf | 0.020 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 1.000 |
| 2 | 2 | 0.000 |
| 3 | +Inf | 0.000 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 1.000 |
| 2 | 2 | 0.000 |
| 3 | +Inf | 0.000 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 1.000 |
| 2 | 2 | 0.000 |
| 3 | +Inf | 0.000 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 1.000 |
| 2 | 2 | 0.000 |
| 3 | +Inf | 0.000 |