冒泡排序法 结果出错为啥

Question

#include
using namespace std;
int main()
{
int i,j,t;
int a[5];
cout<<"enter data:"< for(i=0;i cin>>a[i];
for(i=0;i for(j=0;j if(a[j]>a[j+i])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}

for(i=0;i<5;i++)
cout<<a[i]<<" ";
cout<<endl;
return 0;

}

Answer 1

问题解决的话，请点下采纳

#include <iostream>
using namespace std;
int main()
{
int i,j,t;
int a[5];
cout<<"enter data:"<< endl;
for(i=0;i < 5; i++)
cin>>a[i];
for(i=0;i < 4; i++)
for(j=0;j < 4 - i; j++)
if(a[j]>a[j+1]) //是j+1不是j+i
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
for(i=0;i<5;i++)
cout<<a[i]<<" ";
cout<<endl;
return 0;
}