int？ Low? =? 0;

int？ High =? n？ - 1; ? //Set the initial value of the variable?

int？ tmp，j； ?

What time? (low? & lt？ High)? {?

For what? (j=？ Low; ? j & lt？ High; ? ++j)？ //bubbling, looking for the biggest one?

What if? (r[j]& gt； ? r[j+ 1])？ {?

tmp？ =? r[j]； ? r[j]= r[j+ 1]； r[j+ 1]= tmp； ?

}

-high; ? //Modify the high value. Move forward one position?

For what? (? J = high; ? J> is low; ? - j)？ //Reverse bubbling and find the smallest one?

What if? (r[j]& lt； r[j- 1])？ {?

tmp？ =? r[j]； ? r[j]= r[j- 1]； r[j- 1]= tmp； ?

}?

++low level; ? //Modify the low value and move it back one place?

}

}