冒泡排序-升序

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
	//冒泡排序
	int n;
	cout << "请输入数组个数：" << endl;
	cin >> n;
	int* score = new int[n];
	cout << "输入数组元素:";
	for (int i = 0; i < n; i++)
	{
		cin >> score[i];
	}
	cout << "输出数组元素:" << endl;
	for (int k = 0; k < n; k++)
	{
		cout << score[k] << " ";
	}
	cout << "冒泡排序" << endl;
	for (int x = 0; x < n-1; x++)
	{
		for (int y = 0; y < n-x-1; y++)
		{
			if (score[y] > score[y + 1])
			{
				int temp = score[y];
				score[y] = score[y + 1];
				score[y + 1] = temp;
			}
			
		}
	}
	cout << "输出冒泡排序后数组元素:";
	for (int z= 0; z < n; z++)
	{
		cout << score[z] << " ";
	}


	return 0;
}