Question

C++关于二维数组降序排列的问题

#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
int b[3][6]={1,2,3,4,5,6,
7,8,9,10,11,12,
13,14,15,16,17,18};
int i,j,m,n,t,begin;

for(m=0;m<3;m++)
for(n=0;n<6;n++){
begin=n+1;
for(i=m;i<3;i++){
for(j=begin;j<6;j++)
if(b[m][m]<b[i][j]){
t=b[m][n];
b[m][n]=b[i][j];
b[i][j]=t;
}
begin=0;
}
}
for(m=0;m<3;m++){
for(n=0;n<6;n++)
cout<<setw(4)<<b[m][n]<<" ";
cout<<endl;
}
return 0;
}

到底错在了哪个地方？请高人帮忙指点和修改一下

Answer 1

if(b[m][n]<b[i][j]){
    t=b[m][n];
    b[m][n]=b[i][j];
    b[i][j]=t;
}
而不是
if(b[m][m]<b[i][j])