c++ 冒泡排序、鸡尾酒

//#include <math.h>
int cocktail_sort(int &length)
{
	int i = 0;
	int count = 0;
	int index = 0;
	length = sizeof(arr) / sizeof(*arr);
	int len = ceil(length / 2.0);
	for (; i <len; i++)
	{
		for (int j = 0; j < length; j++)
		{
			if (arr[j] < arr[j+1])
			{
				count = arr[j+1];
				arr[j+1] = arr[j];
				arr[j] = count;
			}
			if (j + 1<length&&arr[length - j - 1] > arr[length - j - 2])
			{
				index = arr[length - j - 1];
				arr[length - j - 1] = arr[length - j - 2];
				arr[length - j - 2] = index;
			}
		}
	}
	return 0;
}

//进化
int cocktail_sort(int &length)
{
	bool isOne=true;
	int i = 0;
	int count = 0;
	int index = 0;
	for (; isOne && i <length; i++)
	{
		for (int j = 0; j < length; j++)
		{
			if (arr[j] < arr[j+1])
			{
				isOne = true;
				count = arr[j+1];
				arr[j+1] = arr[j];
				arr[j] = count;
			}
			if (j + 1<length&&arr[length - j - 1] > arr[length - j - 2])
			{
				index = arr[length - j - 1];
				arr[length - j - 1] = arr[length - j - 2];
				arr[length - j - 2] = index;
			}
		}
		isOne = false;
	}
	return 0;
}