算法-快速排序

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int swap(int source[],int a,int b)
{
int temp;
temp = source[a];
source[a] = source[b];
source[b] = temp;
return 0;
}
int quicksort(int source[], int L, int R)
{
if (L < R)
{
int mid;
mid =partition(source, L, R);
quicksort(source, L, mid-1);
quicksort(source, mid+1, R);

}
}
int partition(int source[], int L, int R)
{

int less = L - 1;
int more = R;
while (L < more)
{
if (source[L] < source[R])
{
swap(source, L++, ++less);
}
else if (source[L] > source[R])
{
swap(source, L, --more);
}
else L++;
}
swap(source, more, R);
return less+1;

}
int main()
{
int source[] = { 10,16,8,9,25,26,17,93,94,3,49,31,17 };
int len;
len = sizeof(source) / sizeof(int);
quicksort(source, 0, len-1 );
for (int i = 0; i < len; i++)
{
printf("%d ", source[i]);
}
}

转载于:https://www.cnblogs.com/cyyz-le/p/11249754.html