冒泡排序(从大到小)
------------------------------------------------------------------------------------------->
public class Maopao {
public void bigTosmall() {
int array[] = { 8,0,6,3,-12,19,1 };
for (int i = 0; i < array.length; i++) {
for (int j = i + 1; j < array.length; j++) {
if (array[i] < array[j]) {
int temp = array[i];
array[i] = array[j];
array[j] = temp;
}
}
}
for (int i = 0; i < array.length; i++) {
System.out.print(" " + array[i] + " ");
}
}
public static void main(String[] args) {
Maopao m = new Maopao();
m.bigTosmall();
}
}
---------------------------------------------------------------------------<
从小到大
------------------------------------------------------------------------------------->
public class MaopaosmallBig {
public static void main(String[] args) {
int[] a = { 2, 3, 4, 5, 8, 0, -3, 9, 6 };
int temp = 0;
for (int i = 1; i < a.length; i++) {
for (int j = 0; j < a.length - i; j++) {
if (a[j] > a[j + 1]) {
temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
}
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + " ");
}
}
}
-------------------------------------------------------------------------------------<