一、定义数组的方法: int[] scores=new int[]{60,70,50,22,21}
int[] scores={60,70,50,22,21}
int[] scores=new int[5];
for(int i=0;i<3;i++)
scores[i]=i+1;
}
二、数组的排序:
private void swap(int[] source, int x, int y) {
int temp = source[x];
source[x] = source[y];
source[y] = temp;
}
public void bubbleSort(int[] source, String sortType) {
if (sortType.equals("asc")) { //正排序,从小排到大
for (int i = source.length - 1; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (source[j] > source[j + 1]) {
swap(source, j, j + 1);
}
}
}
} else if (sortType.equals("desc")) { //倒排序,从大排到小
for (int i = source.length - 1; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (source[j] < source[j + 1]) {
swap(source, j, j + 1);
}
}
}
} else {
System.out.println("您输入的排序类型错误!");
}
三、冒泡排序算法:
public class BubbleSort { public static void sortiere(int[] x) { boolean unsortiert=true; int temp; while (unsortiert){ unsortiert = false; for (int i=0; i < x.length-1; i++) if (x[i] > x[i+1]) { temp = x[i]; x[i] = x[i+1]; x[i+1] = temp; unsortiert = true; } } } public static void main(String[] args) { int[] liste = {0,9,4,6,2,8,5,1,7,3}; sortiere(liste); for (int i=0; i<liste.length; i++) System.out.print(liste[i]+" "); } }