1, ascending as follows:
Package lxyq;
public class Test {
public static void sort (int[] array)//Sort
{
for (int i = 0; i < Array.Length; i++) {
for (int j = i + 1; j < Array.Length; J + +) {
System.out.println (j+ "<<>>>" +i);
if (Array[j] < array[i]) {
int temp = Array[j];
ARRAY[J] = Array[i];
Array[i] = temp;
}
}
}
}
public static void Main (string[] args) {
Int[] A = {1, 6, 2, 0};
Sort (a);
for (int i = 0; i < a.length; i++) {
System.out.println (A[i]);
}
}
}
2, descending as follows:
Package lxyq;
public class Test {
public static void sort (int[] array)//Sort
{
for (int i = 0; i < Array.Length; i++) {
for (int j = i + 1; j < Array.Length; J + +) {
System.out.println (j+ "<<>>>" +i);
if (Array[j] > Array[i]) {
int temp = Array[j];
ARRAY[J] = Array[i];
Array[i] = temp;
}
}
}
}
public static void Main (string[] args) {
Int[] A = {1, 6, 2, 0};
Sort (a);
for (int i = 0; i < a.length; i++) {
System.out.println (A[i]);
}
}
}
Java Bubble Sort