boolean isSorted = false;
for(int i = 0; i < ns.length - 1; i++)
{
isSorted = true;
for(int j = 0; j < ns.length - i - 1; j++){
if(ns[j] < ns[j+1]) {
int tmp = ns[j];
ns[j] = ns[j + 1];
ns[j + 1] = tmp;
isSorted = false;
}
if(isSorted) break;
Sign in to make a reply
干饭不香?
boolean isSorted = false;
for(int i = 0; i < ns.length - 1; i++)
{
isSorted = true;
for(int j = 0; j < ns.length - i - 1; j++){
if(ns[j] < ns[j+1]) {
int tmp = ns[j];
ns[j] = ns[j + 1];
ns[j + 1] = tmp;
isSorted = false;
}
}
if(isSorted) break;
}