#include<iostream>
using namespace std;
void main()
{
int i, j, n;
int* p = NULL;
cout << "输入个数" << endl;
cin >> n;
cout << "输入数值" << endl;
p = (int*)malloc(sizeof(n));
for (i = 0; i < n; i++)
cin >> p[i];
for(i=0;i<n-1;i++)
for (j = 0; j < n; j++)
{
if (p[j] > p[j + 1])
{
int t;
t = p[j];
p[j] = p[j + 1];
p[j + 1] = t;
}
if (j == n)break;
}
for (i = 0; i < n; i++)
cout << p[i];
free(p);
}
利用指针实现冒泡排序C++
最新推荐文章于 2024-01-22 11:38:30 发布