快速排序 选择排序

//选择排序 
//每次找出数字最小的那个对应的索引 放在第i个位置
void select(int arr[],int len){
	for (int i = 0; i < len-1; i++)//循环执行len-1次
	{
		int minIndex = i;
		for (int j = i+1; j < len; j++)
		{
			if (arr[j]<arr[minIndex]){
				minIndex = j;
			}
		}
		if (i!=minIndex){
			int temp = arr[i];
			arr[i] = arr[minIndex];
			arr[minIndex] = temp;
		}
	}
}

//冒泡排序法
void bubbleUp(int arr[],int len){
	for (int i = 0; i < len-1; i++)
	{
		for (int j = 0; j < len-i-1; j++)
		{
			if (arr[j]>arr[j+1]){
				int temp = arr[j];
				arr[j] = arr[j+1];
				arr[j+1] = temp;
			}
		}
	}
}

void velocity(int low,int high,int arr[]){
	int temp = 0;
	int base = arr[low];//参照数
	int i = low;
	int j = high;
	while (i<j)
	{
		while (arr[j]>=base )
		{
			j--;
		}
		while (arr[i]<=base)
		{
			i++;
		}
		temp = arr[j];
		arr[j] = arr[i];
		arr[i] = temp;
	}
	arr[low] = arr[i];
	arr[i] = base;
	velocity(low, j - 1, arr);
	velocity(i+1, high, arr);

}