整数划分和快速排序

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

int q(int n, int m) {
    int p;
    if (n < 1 || m < 1)p = 0;
    else if (n == 1 || m == 1)p = 1;
    else if (n <= m)p = q(n, n - 1) + 1;
    else p = q(n, m - 1) + q(n - m, m);
    return p;
}
int main()
{
    int a;
    a = q(7, 7);
    printf("%d", a);
    return 0;
}

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

void swap(int &a, int &b) {
    int temp;
    temp = a;
    a = b;
    b = temp;
}

int split(int A[], int low, int high) {
    int k, i = low;
    int x = A[low];
    for (k = low + 1; k <= high; k++) {
        if (A[k] <= x) {
            i = i + 1;
            if (i != k)
                swap(A[i], A[k]);
        }
    }
    swap(A[low], A[i]);
    return i;
}

void quick_sort(int A[], int low, int high) {
    int k;
    if (low < high) {
        k = split(A, low, high);
        quick_sort(A, low, k - 1);
        quick_sort(A, k + 1, high);
    }
}

int main()
{
    int A[] = { 5,8,4,9,3,6,7,2 };
    quick_sort(A, 0, 7);
    for (int i = 0; i <= 7; i++) {
        printf("%d\t", A[i]);
    }
    return 0;
}