1、快速排序
#include<stdio.h>
void qsort(int *a, int left, int right)
{
if (left >= right)
{
return ;
}
int i = left;
int j = right;
int key = a[left];
while (i < j)
{
while (i < j && key <= a[j])
{
j--;
}
a[i] = a[j];
while (i < j && key >= a[i])
{
i++;
}
a[j] = a[i];
}
a[i] = key;
sort(a, left, i - 1 );
sort(a, i + 1 , right);
}
int main() {
int a[] = { 10 ,2 ,0 ,34 ,5 ,7 ,4 ,8 };
qsort(a, 0 , 6 );
for (int i = 0 ; i < 7 ; i++) {
printf ("%d\n" , a[i]);
}
}
2、归并排序
#include <stdlib.h>
#include <stdio.h>
void Merge(int sourceArr[], int tempArr[], int startIndex, int midIndex, int endIndex)
{
int i = startIndex, j = midIndex + 1 , k = startIndex;
while (i != midIndex + 1 && j != endIndex + 1 )
{
if (sourceArr[i] > sourceArr[j])
tempArr[k++] = sourceArr[j++];
else
tempArr[k++] = sourceArr[i++];
}
while (i != midIndex + 1 )
tempArr[k++] = sourceArr[i++];
while (j != endIndex + 1 )
tempArr[k++] = sourceArr[j++];
for (i = startIndex; i <= endIndex; i++)
sourceArr[i] = tempArr[i];
}
void MergeSort(int sourceArr[], int tempArr[], int startIndex, int endIndex)
{
int midIndex;
if (startIndex < endIndex)
{
midIndex = (startIndex + endIndex) / 2 ;
MergeSort(sourceArr, tempArr, startIndex, midIndex);
MergeSort(sourceArr, tempArr, midIndex + 1 , endIndex);
Merge(sourceArr, tempArr, startIndex, midIndex, endIndex);
}
}
int main(int argc, char * argv[])
{
int a[8 ] = { 50 , 10 , 20 , 30 , 70 , 40 , 80 , 60 };
int i, b[8 ];
MergeSort(a, b, 0 , 7 );
for (i = 0 ; i<8 ; i++)
printf ("%d " , a[i]);
printf ("\n" );
return 0 ;
}