13、冒泡排序

void gj() {   //**复杂排序实现**

char data[] = {'D', 'a', 'b', 'C', 'A', 'd', 'B', 'c'};  
//**结果是AaBbCcDd**
	for (int x = 0; x < 8 - 1; x++) {
		for (int y = 0; y < 8 - 1 - x; y++) {

			/*	double a = data[y];	if(a > 90){	a = a - 31.5; }	double b = data[y + 1];	if(b > 90){	b = b - 31.5; }*/
			double a = data[y] > 90 ? data[y] - 31.5 : data[y];
			double b = data[y + 1] > 90 ? data[y + 1] - 31.5 : data[y + 1];
			if (a > b) {
			data[y] = (char)(data[y] ^ data[y + 1]);
			data[y + 1] = (char)(data[y] ^ data[y + 1]);	
			data[y] = (char)(data[y] ^ data[y + 1]); }
		}
	}
	for (char x : data)
	{cout<<x<<endl; }
}

int main() {     //冒泡排序
	int data[] = {6,7,8,1,2,0};
	int len = sizeof(data) / sizeof(data[0]);
	cout << "总共有多少个元素" +len << endl;
	cout << "开始排序 == = " << endl;
	for (int i = 0; i < len - 1; i++)  //循环N-1次，最后一个元素位置  自动确定
		for (int j = 0; j < len - 1 - i; j++)
		{
			if (data[j] > data[j + 1]) {
				data[j] = data[j] ^ data[j + 1];
				data[j+1] = data[j] ^ data[j + 1];
				data[j] = data[j] ^ data[j + 1];
			}
		}
	for (int i = 0; i < len; i++)cout << data[i] << endl;
	gj();
	system("pause");
	return 0;
}