병합정렬 구현

1 C

C 병합정렬 구현 문서를 참고하십시오.

#include <stdio.h>
void merge(int arr[], int left, int middle, int right) {
    int temp[right-1], i, j, k;
	for(i=left, j=left, k=middle+1; j<=middle && k<=right; i++) {
		if(arr[j]<=arr[k]) temp[i]=arr[j++];
		else temp[i]=arr[k++];
	}
	while(j <= middle) temp[i++]=arr[j++];
	while(k <= right) temp[i++]=arr[k++];
	for(i=left; i<=right; i++) arr[i]=temp[i]; 
}
void merge_sort(int arr[], int left, int right) {
	if(left >= right) return;
	int middle = (left+right)/2;
	merge_sort(arr, left, middle);
	merge_sort(arr, middle+1, right);
	merge(arr, left, middle, right);
}
int main() {
    int arr[] = {3,4,2,1,7,5,8,9,0,6,100,10};
    int size = sizeof(arr)/sizeof(int);
	merge_sort(arr, 0, size-1);
	for(int i=0; i<size; i++) printf("%d ", arr[i]);
	// 0 1 2 3 4 5 6 7 8 9 10 100
}

2 같이 보기

• 정렬 구현
• 병합정렬