自己学习数据结构的编程练习;
平台:MacOS Catalina
软件:Xcode
时间:10 mins
排序
- 冒泡
- 插入
- 选择
- 快速排序
以下为快速排序的程序练习
#include "stdio.h"
#include "string.h"
#include "ctype.h"
#include "stdlib.h"
//#include "io.h"
#include "math.h"
#include "time.h"
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define MAXSIZE 6
int FindPos(int *a, int low, int high)
{
int val = a[low];
while(low < high )
{
// 小的往前,大的往后
while(low < high && a[high] >val)
--high;
a[low] = a[high];
while(low<high && a[low]<= val)
++low;
a[high] = a[low];
}//终止while循环之后low 和 high一定是相等的
a[low] = val;
return low; //high 和 low 相等
}
void QuickSort(int *a, int low, int high)
{
int pos;
if(low < high)
{
pos = FindPos(a, low, high);
QuickSort(a, low, pos-1);
QuickSort(a, pos+1, high);
}
}
int main(void)
{
int a[6]={2, 1, 0, -5, 4, 3};
int i;
QuickSort(a, 0, 5);
for(i=0; i<6; ++i)
{
printf("%d ",a[i]);
}
printf("\n");
return 0;
}