qSort - examen SD

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

void qSort(int vector[], int stg, int dr)
{
    int temp, mijl, min, max;
    min = stg;
    max = dr;
    mijl = vector[stg + (dr - stg) / 2];
    do
    {
        while(vector[min] < mijl)
            min++;
        while(vector[max] > mijl)
            max--;
        if(min <= max)
        {
            temp = vector[min];
            vector[min++] = vector[max];
            vector[max--] = temp;
        }
    }while(min <= max);
    if(stg < max)
        qSort(vector, stg, max);
    if(dr > min)
        qSort(vector, min, dr);
}

int main()
{
    int nr, i, x;
    int *v;
    scanf("%d", &nr);
    v = (int*) malloc(nr*sizeof(int));
    for(i=0;i<nr;i++)
    {
        scanf("%d", &x);
        v[i] = x;
    }
    qSort(v, 0, nr);
    for(i=0;i<nr;i++)
    {
        printf("%d ", v[i]);
    }
    printf("\n");
    free(v);
    return 0;
}