Hitro urejanje: Razlika med redakcijama

Izbrisana vsebina Dodana vsebina
Thijs!bot (pogovor | prispevki)
m robot Spreminjanje: lt:Greitojo rikiavimo algoritmas
Vrstica 200:
=== [[Programski jezik C|C]] ===
<code><pre><nowiki>
void quicksortq_sort(int anumbers[], int linksleft, int rechtsright) {
{
int li=links, re=rechts, test = a[(links + rechts)/2];
int l_hold int i,= swapleft;
int r_hold = right;
 
int pivot = numbers[left];
printf("\n\nQuicksort-Aufruf, Testzahl ist %d\n", test);
while (left < right)
ausgabe(links, rechts, li, re);
do {
while ((numbers[right] >= pivot) while&& (a[li]left < testright)) li++;
while (a[re] > test) reright--;
if (lileft <!= reright) {
{
printf("Zu tauschen:\n");
numbers[left] = numbers[right];
ausgabe(links, rechts, li, re);
swap = a[li]left++;
}
a[li] = a[re];
while ((numbers[left] <= pivot) && (left < right))
a[re] = swap;
lileft++;
if (left != re--;right)
{
printf("Nach Tausch:\n");
numbers[right] = numbers[left];
ausgabe(links, rechts, li, re);
}right--;
} while (li <= re);
}
printf("Quicksort beendet!\n");
numbers[left] = pivot;
if (links < re) quicksort(a, links, re);
pivot = left;
if (li < rechts) quicksort(a, li, rechts);
left = l_hold;
right = r_hold;
if (left < pivot)
q_sort(numbers, left, pivot-1);
if (right > pivot)
q_sort(numbers, pivot+1, right);
}
void quickSort(int numbers[], int array_size)
{
q_sort(numbers, 0, array_size - 1);
}
</nowiki></pre></code>