#include
using namespace std;
Void out the Tsort (int q [], int size)
{
Vector
Vector
//int t=0;
for(int i=0; i
Int t=q [I]/10;
A [t] push_back (q [I]);
If (a [t]. The size ()!=NULL)
{int s=a [t]. The size ();
For (int j=s - 2; J>=0; J -)
If (a [t] [I] Int temp=a, [t] [I].
A [t] [I]=[t] a [j];
A, [t] [j]=temp.
}
}
The else
A [t] push_back (q [I]);
}
for(int k=0; K
}
Int main ()
{
,24,15,37,86,45,72,26,34,36,52,54,89 int q []={12};
Out the Tsort (q), 13);
}
The program crashes and great spirit to reassure
CodePudding user response:
A [t] push_back (q [I]); This statement. This problem will produce excessive boundary. (how curious compiled by this statement, but a vector
CodePudding user response: