Pagini recente » Cod sursa (job #1259490) | Cod sursa (job #653750) | Cod sursa (job #1017039) | Cod sursa (job #7228) | Cod sursa (job #2282917)
#include <stdio.h>
#include <stdlib.h>
using namespace std;
void interschimba(int &a, int &b) {
int aux = a;
a = b;
b = aux;
}
void alegere_pivot(int *v, int left, int right) {
int poz;
poz = right;
}
int partitionare(int *v, int left, int right) {
alegere_pivot(v, left, right);
int pivot = v[right], ileft = left, iright = right - 1;
do {
while (v[ileft] < pivot)
ileft++;
while (v[iright] > pivot)
iright--;
if (ileft < iright) {
interschimba(v[ileft], v[iright]);
ileft++;
iright--;
}
else
return ileft;
}
while (true);
}
void quicksort(int *v, int left, int right) {
if (right - left > 0) {
int poz = partitionare(v, left, right);
interschimba(v[poz], v[right]);
quicksort(v, left, poz - 1);
quicksort(v, poz + 1, right);
}
}
int main() {
freopen("algsort.in", "r", stdin);
freopen("algsort.out", "w", stdout);
int n, numar;
scanf("%d", &n);
int numere[n];
for (int i = 0; i < n; i++) {
scanf("%d", &numar);
numere[i] = numar;
}
quicksort(numere, 0, n - 1);
for (int i = 0; i < n; i++)
printf("%d ", numere[i]);
return 0;
}