归并排序
时间复杂度:O(nlogn)
空间复杂度:O(n)
代码:
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdbool.h>
#define swap(a,b) {typeof(a) temp=a; a=b; b=temp;}
void show(int* arr, size_t len)
{
for(int i=0; i<len; i++)
{
printf("%d ",arr[i]);
}
printf("\n");
}
void merge(int* arr,size_t left,size_t pi,size_t right)
{
int i=left,j=pi+1,k=0;
int temp[right-left+1];
while(i<=pi && j<=right)
{
if(arr[i] < arr[j])
temp[k++] = arr[i++];
else
temp[k++] = arr[j++];
}
while(i<=pi) temp[k++] = arr[i++];
while(j<=right) temp[k++] = arr[j++];
for(int i=0; i<=(right-left); i++)
{
arr[i+left] = temp[i];
}
}
void _merge_sort(int* arr,size_t left,size_t right)
{
if(left >= right) return;
int pi = (left+right)/2;
_merge_sort(arr,left,pi);
_merge_sort(arr,pi+1,right);
merge(arr,left,pi,right);
}
void merge_sort(int* arr,size_t len)
{
_merge_sort(arr,0,len-1);
}
int main()
{
int arr[10];
for(int i=0; i<10; i++)
{
printf("%d ",arr[i]=rand()%100);
}
printf("\n");
merge_sort(arr,10);
show(arr,10);
}