#include <stdio.h>
#include <stdlib.h>
#define MAX_SIZE 10
void Swap(int *p, int *q)
{
int buf;
buf = *p;
*p = *q;
*q = buf;
}
//冒泡排序:
void Sort(int *p, int n)
{
int i,j,t,flag;
for(i=1;i<n;)
{
flag=0;
for(j=0;j<n-i;j++)
{
if(p[j]>p[j+1])
{
t=p[j];
p[j]=p[j+1];
p[j+1]=t;
}
flag=1;
}
if(flag=1)
i++;
}
}
//定位函数
int partition(int *a, int low, int high){
int k=a[low];
while(low<high)
{
while(low<high&&a[high]>=k) high–;
Swap(&a[low], &a[high]);
while(low<high&&a[low]<=k) low++;
Swap(&a[low], &a[high]);
}
return low;
}
//快排
void QuickSort(int *a, int low, int high)
{
/[low,high]
int k;
if(low<high)
{
k=partition(a,low,high);
QuickSort(a, low,k-1);
QuickSort(a, k+1,high);
}
}
void main()
{
int a[MAX_SIZE];
int b[MAX_SIZE];
int i;
printf("\n待排数组a为:");
for (i = 0; i < MAX_SIZE; i++)
{
a[i] = rand() % 100; //0~100之间的随机数
printf("%6d",a[i]);
}
printf("\n待排数组b为:");
for (i = 0; i < MAX_SIZE; i++)
{
b[i] = rand() % 50;
printf("%6d",b[i]);
}
printf("\n");
Sort(a,MAX_SIZE); //冒泡排序
printf("\n\na冒泡排序后:");
for (i = 0; i < MAX_SIZE; i++)
printf("%6d", a[i]);
printf("\n");
QuickSort(b, 0, MAX_SIZE-1); //快排
printf("\n\nb快速排序后:");
for (i = 0; i < MAX_SIZE; i++)
printf("%6d", b[i]);
printf("\n\n\n");
system("pause");
}