Объектно-ориентированное программирование на С++ - eDrive

}
45
for (int i=1; i=0 + 1; – –j)
if (array[j–1] > array[j]) Swap (array[j], array[j–1]);
void ShellSort (int array[], int N) {
int delta = 1, sw, offset = (N–1+delta) / 2;
while (offset > 0) {
int limit = N–1+delta–offset;
do {
sw = 0;
for (int i=1; iarray[i+offset–delta]) {
Swap (array[i–delta], array[i+offset–delta]); sw = i;
}
limit = sw – offset;
} while (sw);
offset /= 2;
}
}
void QuickSort (int array[], int left, int right) {
int i = left, j = right, temp, test = array [(left+right) / 2];
do {
while (array[i] < test) ++i;
while (test < array[j]) ––j;
if (i RadioGroup1–>ItemIndex) {
case 0: BubbleSort (array, N); break;
case 1: ExchangeSort (array, N); break;
case 2: InsertionSort (array, N); break;
case 3: ShellSort (array, N); break;
case 4: QuickSort (array, 0, N–1); break;