原文地址:http://blog.youkuaiyun.com/zuoluoboy/article/details/4123943
http://blog.youkuaiyun.com/lenotang/article/details/3411346
冒泡排序:
for (int i = 1; i < x.length; i++) {
for (int j =0 ; j < x.length-i; j++) {
if(x[j]>x[j+1]){
int temp=x[j];
x[j]=x[j+1];
x[j+1]=temp;
}
}
}
选择排序:
for (int i = 0; i < x.length; i++) {
for (int j = i + 1; j < x.length; j++) {
if (x[i] > x[j]) {
int temp = x[i];
x[i] = x[j];
x[j] = temp;
}
}
}