functioniterativeQuickSort
Quick sort algorithm
Inputs
| Type | Name | Default | Description |
|---|---|---|---|
| Real[:] | A | ||
| Integer | first | 1 | |
| Integer | last | size(A, 1) |
Outputs
| Type | Name | Default | Description |
|---|---|---|---|
| Real[size(A, 1)] | B | ||
| Integer[size(A, 1)] | I |
| Type | Name | Default | Description |
|---|---|---|---|
| Real[:] | A | ||
| Integer | first | 1 | |
| Integer | last | size(A, 1) |
| Type | Name | Default | Description |
|---|---|---|---|
| Real[size(A, 1)] | B | ||
| Integer[size(A, 1)] | I |