快速排序（quickSort）

#include <stdio.h> int t, i, j, n, temp, seq[100]; int patition(int start, int end) { temp = seq[end]; j = end; i = start; while (j > i) { while (j > i && seq[i] <= temp) i++; seq[j] = seq[i]; while (j > i && seq[j] >= temp) j--; seq[i] = seq[j]; } seq[j] = temp; return j; } void quickSort(int start, int end) { int mid; if (start < end) { mid = patition(start, end); quickSort(start, mid-1); quickSort(mid+1, end); } } void print(void) { printf("%d", seq[0]); for (i = 1; i < n; i++) printf(" %d", seq[i]); puts(""); } int main() { scanf("%d", &t); while (t--) { scanf("%d", &n); for (i = 0; i < n; i++) scanf("%d", &seq[i]); quickSort(0, n-1); print(); } return 0; }