学习笔记0630

排序方法

——————————————————————————————————

选择排序

从未排序的元素中选择其中最小（大）的依次排序

int sortArray(int a[])
{
	int i = 0, j = 0;
	int tmp;
	for (i=0; i<10; i++) //外层循环
	{
		for (j=i+1; j<10; j++) //内层循环
		{
			if (a[i] > a[j])
			{
				tmp = a[i];
				a[i] = a[j];
				a[j] = tmp;
			}
		}
	}
	return 0;
}

————————————————————————————————————

插入排序

依次选择元素作为基准，并与前面已排序部分笔记，满足大于（或小于）将前面元素后移

void InsertionSort(int array[], int len)
{
	int i = 0;
	int j = 0;
	int k = -1;
	int temp = -1;
	for(i=1; i<len; i++)
	{
		k = i;
		temp = array[k];
		for(j = i-1; (j>=0)&&(array[j]>temp);j--)
		{
			array[j+1] = array[j];
			k = j;
		}
		array[k] = temp;
	}
	 
}

————————————————————————————————————

冒泡排序

相邻元素不断比较，直至最小（大）冒出，接下来进行未排序冒泡

void swap(int array[], int i, int j)
{
	int temp;
	temp = array[i];
	array[i] = array[j];
	array[j] = temp;
}
void BubbleSort(int array[], int len)
{
	int i = 0;
	int j = 0;
	int flag = 1;//优化
	for(i=0; (i<len)&&flag; i++)
	{
		flag = 0;
		for(j=len-1; j>i; j--)
		{
			if(array[j] < array[j-1])
			{
				swap(array, j, j-1);
				flag = 1;
			}
		}
	}
}

————————————————————————————————————

希尔排序

对插入排序的改进，先分组进行插入排序，逐步增大组数，减少组距

void InsertionSort(int array[], int len)
{
	int i = 0;
	int j = 0;
	int k = -1;
	int temp = -1;
	int gap = len;
	do
	{
		gap = gap/3 + 1;
		for(i=gap; i<len; i+=gap)
		{
			k = i;
			temp = array[k];
			for(j = i-gap; (j>=0)&&(array[j]>temp);j-=gap)
			{
				array[j+gap] = array[j];
				k = j;
			}
			array[k] = temp;
		}
	}while(gap>1);

}

————————————————————————————————————

快速排序

先设置标志位将大于小于标志位的分别放置到标志位的一侧，递归

void swap(int array[], int i, int j)
{
	int temp;
	temp = array[i];
	array[i] = array[j];
	array[j] = temp;
}
int partition(int array[], int low, int high)
{
	int flagdata = array[low];
	while(low<high)
	{
		while((low<high) && (array[high]>=flagdata))
		{
			high--;
		}
		swap(array, low, high);
		while((low<high) && (array[low]<=flagdata))
		{
			low++;
		}
		swap(array, low, high);
	}
	return low;
}
void QuickSort(int array[], int low, int high)
{
	if(low<high)
	{
		int mid = partition(array,low, high);
		QuickSort(array, low, mid);
		QuickSort(array, mid+1, high);
	}
}
void QuickSortL(int array[], int len)
{
	QuickSort(array, 0, len-1);
}

————————————————————————————————————

归并排序

先划分，再对有序序列归并

void swap(int array[], int i, int j)
{
	int temp;
	temp = array[i];
	array[i] = array[j];
	array[j] = temp;
}
void Merge(int src[], int des[], int low, int mid, int high)
{
	int i = low;
	int j = mid + 1;
	int k = low;
	while((i<=mid)&&(j<=high))
	{
		if(src[i]<src[j])
		{
			des[k++] = src[i++];
		}
		else
		{
			des[k++] = src[j++];
		}
	}
	while(i<=mid)
	{
		des[k++] = src[i++];
	}
	while(j<=high)
	{
		des[k++] = src[j++];
	}
}

void MSort(int  src[], int des[], int low, int high, int max)
{
	if(low==high)
	{
		des[low] = src[low];
	}
	else
	{
		int mid = (low+high)/2;
		int* space = (int*)malloc(sizeof(int)*max);
		if(space != NULL)
		{
			MSort(src, space, low, mid, max);
			MSort(src, space, mid+1, high, max);
			Merge(space, des, low, mid, high);
		}
		free(space);
	}
}
void MergeSort(int array[], int len)
{
	MSort(array, array, 0, len -1, len);
}

————————————————————————————————————