日常操作中常见的排序方法有:冒泡排序、快速排序、选择排序、插入排序、希尔排序,甚至还有基数排序、鸡尾酒排序、桶排序、鸽巢排序、归并排序等。
冒泡排序是一种简单的排序算法。它重复地走访过要排序的数列,一次比较两个元素,如果他们的顺序错误就把他们交换过来。走访数列的工作是重复地进行直到没有再需要交换,也就是说该数列已经排序完成。这个算法的名字由来是因为越小的元素会经由交换慢慢“浮”到数列的顶端。
public static void bubbleSort(int[] numbers) {
int temp; // 记录临时中间值
int size = numbers.length; // 数组大小
for (int i = 0; i < size - 1; i++) {
for (int j = i + 1; j < size; j++) {
if (numbers[i] < numbers[j]) { // 交换两数的位置
temp = numbers[i];
numbers[i] = numbers[j];
numbers[j] = temp;
}
}
}
}
public static void main(String args[]) {
Vector nameList = new Vector();
nameList.add("Joe");
nameList.add("William");
nameList.add("Jack");
nameList.add("Averel");
Vector heightList = new Vector();
// Get heights
for (String name : nameList) {
while (true) {
System.out.print(name + "'s height (cm):");
Scanner scanner = new Scanner(System.in);
try {
int height = Integer.valueOf(scanner.nextLine());
if (height < 0) {
System.out.println("Height should not be a negative value.");
continue;
}
heightList.add(height);
break;
} catch (Exception e) {
System.out.println("Height should not be number.");
}
}
}
// Get sort type
boolean isASC = true;
while (true) {
System.out.print("ASC or DESC?:");
Scanner scanner = new Scanner(System.in);
try {
String sortStr = scanner.nextLine();
if (sortStr.equals("ASC")) {
isASC = true;
} else if (sortStr.equals("DESC")) {
isASC = false;
} else {
System.out.println("You should enter ASC or DESC.");
continue;
}
break;
} catch (Exception e) {
System.out.println("You should enter ASC or DESC.");
}
}
// Sort
for (int i = 0; i < heightList.size(); ++i) {
for (int j = i; j < heightList.size(); ++j) {
if (isASC) {
if (heightList.get(i) > heightList.get(j)) {
int temp = heightList.get(i);
heightList.set(i, heightList.get(j));
heightList.set(j, temp);
String t = nameList.get(i);
nameList.set(i, nameList.get(j));
nameList.set(j, t);
}
} else {
if (heightList.get(i) < heightList.get(j)) {
int temp = heightList.get(i);
heightList.set(i, heightList.get(j));
heightList.set(j, temp);
String t = nameList.get(i);
nameList.set(i, nameList.get(j));
nameList.set(j, t);
}
}
}
}
for (int i = 0; i < heightList.size(); ++i) {
System.out.println(nameList.get(i) + " : " + heightList.get(i));
}
}