QuickSort

#include <stdio.h>
void select(int *a, int low, int high) {
    int j,k,i,save;
    j = high;
    while (j > low) {
        k = j;
        i = j - 1;
        while (i >= low) {
            if (a[k] < a[i]) k = i;
            i--;
        }
        save = a[j];
        a[j] = a[k];
        a[k] = save;
        j--;
    }
}
int partion(int *a, int low,int high) {
    int i = low, j = low, save;
    while (j < high) {
        if (a[j] < a[high]) {
            save = a[j];
            a[j] = a[i];
            a[i] = save;
            i++;
        }
        j++;
    }
    save = a[high];
    a[high] = a[i];
    a[i] = save;
    return i;
}

void quick_sort(int *a, int m, int low,int high) {
  int q;
  if (high - low + 1 < m) select(a, low, high); //Если длина меньше m запуск выбор для подпослед;
  else {
      if (low < high) {
        q = partion(a, low, high);
        quick_sort(a, m, low, q-1);
        quick_sort(a, m, q+1, high);
    }
  }
}

void quick(int *a,int m, int n) {
    quick_sort(a, m, 0, n-1);
}

int main() {
    int i, n, m;
    scanf("%d %d", &n, &m);
    int a[n];
    for (i = 0; i < n;i++) scanf("%d", &a[i]);
    quick(a, m, n);
    for (i = 0; i < n;i++) printf("%d ", a[i]);
    return 0;
}