常见排序算法汇总

#include <stdio.h>
#include <stdlib.h>
typedef int Item;
#define key(A) (A)
#define less(A, B) (key(A) < key(B))
#define exch(A, B) {Item t = A; A = B; B = t;}
#define compexch(A, B) if(less(B, A)) exch(A, B)
#define min(A, B) (A < B) ? A : B
#define MAX 20

/*选择排序*/
void selection_sort(Item a[], int l, int r){
	int i, j;
	for(i = l; i < r; i++){
		int min = i;
		for(j = i + 1; j <= r; j++)
			if(less(a[j], a[min]))
				min = j;
		exch(a[i], a[min]);
	}
}

/*插入排序*/
void insertion(Item a[], int l, int r){
	int i;
	for(i = r; i > l; i--)
		compexch(a[i-1], a[i]);

	for(i = l+2; i <= r; i++){
		int j = i;
		Item v = a[i];
		while(less(v, a[j-1])){
			a[j] = a[j-1];
			j--;
		}
		a[j] = v;
	}
}

/*冒泡排序*/
void bubble(Item a[], int l, int r){
	int i, j;
	for(i = l; i < r; i++)
		for(j = r; j > i; j--)
			compexch(a[j-1], a[j]);
}

/*希尔排序*/
void shell_sort(Item a[], int l, int r){
	int i, h;
	for(h = 1; h <= (r-1)/9; h = 3*h+1)
		;
	for( ; h > 0; h /= 3)
		for(i = l+h; i <= r; i++){
			int j = i;
			Item v = a[i];
			while(j >= l+h && less(v, a[j-h])){
				a[j] = a[j-h];
				j -= h;
			}
			a[j] = v;
		}
}

Item aux[MAX];
void merge(Item a[], int l, int m, int r){
	int i, j, k;
	for(i = m+1; i > l; i--)
		aux[i-1] = a[i-1];
	for(j = m; j < r; j++)
		aux[r+m-j] = a[j+1];
	for(k = l; k <= r; k++){
		if(less(aux[j], aux[i]))
			a[k] = aux[j--];
		else
			a[k] = aux[i++];
	}
}

/*归并排序*/
void merge_sort(Item a[], int l, int r){
	int m = (r + l) / 2;
	if(r <= l) return;
	merge_sort(a, l, m);
	merge_sort(a, m+1, r);
	merge(a, l, m, r);
}

void mergeAB(Item c[], Item a[], int N, int b[], int M){
	int i, j, k;
	for(i = 0, j = 0, k = 0; k < N+M; k++){
		if(i == N){
			c[k] = b[j++];
			continue;
		}
		if(j == M){
			c[k] = a[i++];
			continue;
		}
		c[k] = (less(a[i], b[j])) ? a[i++] : b[j++];
	}
}

void mergesortABr(Item a[], Item b[], int l, int r){
	int m = (l + r) / 2;
	if(r-l <= 10){
		insertion(a, l, r);
		return;
	}
	mergesortABr(b, a, l, m);
	mergesortABr(b, a, m+1, r);
	mergeAB(a+l, b+l, m-l+1, b+m+1, r-m);
}

/*自顶向下归并排序*/
void mergesortAB(Item a[], int l, int r){
	int i;
	for(i = l; i <= r; i++)
		aux[i] = a[i];
	mergesortABr(a, aux, l, r);
}

/*自底向上归并排序*/
void mergesortBU(Item a[], int l, int r){
	int i, m;
	for(m = 1; m <= r-l; m = m+m)
		for(i = l; i <= r-m; i+= m+m)
			merge(a, i, i+m-1, min(i+m+m-1, r));
}

/*划分*/
int partition(Item a[], int l, int r){
	int i = l-1, j = r;
	Item v = a[r];
	for(;;){
		while(less(a[++i], v))
			;
		while(less(v, a[--j]))
			if(j == l)
				break;
		if(i >= j)
			break;
		exch(a[i], a[j]);
	}
	exch(a[i], a[r]);
	return i;
}

/*快速排序*/
void quicksort(Item a[], int l, int r){
	int i;
	if(r <= l)
		return;
	i = partition(a, l, r);
	quicksort(a, l, i-1);
	quicksort(a, i+1, r);
}

int main(){
	int arr[] = {43, 87,71, 676,56,45,55,233,2,23,93,432};
	int len = sizeof arr/sizeof arr[0];
	int i;

	puts("Befor sort:");
	for(i = 0; i < len; ++i)
		printf("%d ", arr[i]);
	putchar('\n');

	puts("After sort:");
	quicksort(arr, 0, len-1);
	for(i = 0; i < len; ++i)
		printf("%d ", arr[i]);
	putchar('\n');
	return 0;
}

 

转载于:https://www.cnblogs.com/mocuishle/p/8067611.html