快速排序算法实现(算法记录一)
#include<iostream>
using namespace std;
typedef int TElemType;
TElemType a[10] = { 30,80,90,20,50,60,15,89,79,24 };
void swap(int* ar, int low, int high)
{
int temp;
temp = ar[low];
ar[low] = ar[high];
ar[high] = temp;
}
int QGetValid(int* ar, i
原创
2020-11-25 16:51:10 ·
106 阅读 ·
0 评论