MoXiaopeng的专栏

原创 快速排序代码

#include #include #include void swap(int *a, int *b) { int t = *a; *a = *b; *b = t; } int partition(int a[], int nLeft, int nRight) { int v = a[nRight]; int i = nLeft - 1;