Difference between revisions of "QuickSort"
From SCAR Divi Manual
| Line 5: | Line 5: | ||
==Availability== | ==Availability== | ||
| − | SCAR Divi 3.14 > | + | SCAR Divi 3.14 > 3.37 <span style="color:#FF0000">(Deprecated, use [[SortTIA]])</span> |
* '''Values''' was a [[TIntegerArray]] before SCAR Divi 3.28. | * '''Values''' was a [[TIntegerArray]] before SCAR Divi 3.28. | ||
Latest revision as of 19:34, 10 December 2012
Definition
procedure QuickSort(var Values: TIntArray);
Availability
SCAR Divi 3.14 > 3.37 (Deprecated, use SortTIA)
- Values was a TIntegerArray before SCAR Divi 3.28.
Description
Uses the quicksort sorting algorithm to sort a given set of integer values specified by the TIntArray Values. The values will be sorted small->large.
Example
var
Values: TIntArray;
i: Integer;
begin
Values := [9, 1, 8, 2, 4];
QuickSort(Values);
for i := Low(Values) to High(Values) do
WriteLn(Values[i]);
end.Output:
1 2 4 8 9
