C++编程:编写一个冒泡排序程序，要求使用动态数组，先输入要排序的数字数量n，再依次输入数字。

Answer 1

/*
数据个数n = 5
a[1/5] = 43
a[2/5] = 12
a[3/5] = 78
a[4/5] = 56
a[5/5] = 10
10 12 43 56 78
请按任意键继续. . .
*/
#include <stdio.h>
#include <stdlib.h>

void sort(int a[], int n) {
int i,j,t;
for(i = 0; i < n - 1; i ++) {
for(j = i + 1; j < n; ++j) {
if(a[j] < a[i]) {
t = a[i];
a[i] = a[j];
a[j] = t;
}
}
}
}

int main() {
int i,n,*a;
printf("数据个数n = ");
scanf("%d",&n);
a = (int *)malloc(n * sizeof(int));
for(i = 0; i < n; ++i) {
printf("a[%d/%d] = ",i + 1, n);
scanf("%d",&a[i]);
}
sort(a,n);
for(i = 0; i < n; ++i) printf("%d ",a[i]);
printf("\n");
free(a);
return 0;
}

Answer 2

//---------------------------------------------------------------------------
#include <iostream>
using std::cin;
using std::cout;
using std::endl;

int main(void)
{
int *a,n;
cin>>n;
a=new int[n];
if (!a) return (-1);

for (int i=0; i<n; i++) {
cin>>a[i];
}

for (int i=1; i<=n; i++) {
for (int j=0; j<n-i; j++) {
if (a[j]>a[j+1]) {
int tmp=a[j];
a[j]=a[j+1];
a[j+1]=tmp;
}
}
}

for (int i=0; i<n; i++) {
cout<<a[i]<<'\t';
}
cout<<endl;

delete[] a;
return 0;
}
//---------------------------------------------------------------------------