快速排序c++实现
快排c++实现及编译结果#include <iostream>using namespace std;void quickSort(int left, int right, int* arr){ if (arr == NULL) return; if (left >= right) return; int i = left, j = right; int base = arr[i]; while (i < j) { while (arr[i] &l
原创
2020-10-20 19:14:59 ·
106 阅读 ·
0 评论