C语言 冒泡排序 快速排序 直接插入排序 选择排序

C语言几种常见的算法

#include <stdio.h>

/* 简单选择排序 */
void select_sort(int *p, int len)
{
	int i, j;
	int min, tmp;
	for(i=0; i<len; i++)
	{
		min = i;
		for(j=i+1; j<len; j++)
		{
			if(p[min]>p[j])
			{
				min = j;
			}
		}
		if(i!=min)
		{
			tmp = p[i];
			p[i] = p[min];
			p[min] = tmp;
		}
	}
}

/* 冒泡排序 */
void bubble_sort(int *p, int len)
{
	int i, j, tmp;
	for(i=0; i<len; i++)
	{
		for(j=i+1; j<len; j++)
		{
			if(p[i]>p[j])
			{
				tmp = p[i];
				p[i] = p[j];
				p[j] = tmp;
			}
		}	
	}
}

/* 直接插入排序 */
void insert_sort(int *p, int len)
{
	int i, j, tmp;
	for(i=1; i<len; i++)
	{
		if(p[i]<p[i-1])
		{
			tmp = p[i];
			for(j=i-1; j>=0 && p[j]>tmp; j--)
			{
				p[j+1] = p[j];
			}
			p[j+1] = tmp;
		}
	}
}

/* 交换两个数 */
void swap(int *p, int a, int b)
{
	int tmp;
	tmp = p[a];
	p[a] = p[b];
	p[b] = tmp;
}


/*  */
int partition(int *a, int low, int high)
{
	int key;
	key = a[low];			// 找一个基准点
	while(low<high)			
	{
		while(low<high && a[high]>=key)
			high--;
	//	a[low] = a[high];
		swap(a, low, high);				
		while(low<high && a[low]<=key)
			low++;						
	//	a[high] = a[low];			
		swap(a, low, high);
	}
	return low;
}


/* 快速排序 */
void qsort(int *a, int low, int high)
{
	int pivot;
	if(low<high)
	{
		pivot = partition(a, low, high);
		qsort(a, low, pivot-1);
		qsort(a, pivot+1, high);
	}
}



int main()
{
	int a[] = {2,33,4,432,23,1,423,3,78,932,100};
	int len = sizeof(a)/sizeof(int);
	int i;
	printf("len=%d\n", len);
	bubble_sort(a, len);
	printf("bubbleSort\n");
	for(i=0; i<len; i++)
	{
		printf("%d, ", a[i]);
	}	
	
	
	select_sort(a, len);
	printf("\nselect\n");
	for(i=0; i<len; i++)
	{
		printf("%d, ", a[i]);
	}	
	
	
	insert_sort(a, len);
	printf("\ninsert\n");
	for(i=0; i<len; i++)
	{
		printf("%d, ", a[i]);
	}
	
	
	partition(a, 0, len);	
	qsort(a, 0, 9);
	printf("\nquicksort\n");
	for(i=0; i<len; i++)
	{
		printf("%d, ", a[i]);
	}
}