quick

#include <stdio.h>
#include <stdlib.h>

void quicksort(int a[100], int s, int d) {
       int i = s, j = d;
       int x = a[(s + d) / 2];
       do {
              while (a[i]<x) i++;
              while (a[j]>x) j--;
              if (i <= j) {
                     int temp = a[i];
                     a[i] = a[j];
                     a[j] = temp;
                     i++;
                     j--;
              }
       } while (i <= j);

       if (s<j) quicksort(a,s, j);
       if (d>i) quicksort(a,i, d);
}
int a[100], i, n;
int main()
{
    printf("Nr de elemente: ");
    scanf("%d", &n);
    for(i=1;i<=n;i++)
        scanf("%d", &a[i]);
    quicksort(a,1,n);
    for(i=1;i<=n;i++)
        printf("%d ", a[i]);
    return 0;
}