Java代码:
package cho2;
public class Array {
public static void main(String[] args) {
int[] arr = { 12, 56, 79, 45, 63 };
System.out.print("原数组为:");
Array.display(arr);
System.out.println();
// 冒泡排序
Array.bubbleSort(arr);
System.out.print("冒泡排序后的数组为:");
Array.display(arr);
System.out.println();
// 选择排序
Array.selectSort(arr);
System.out.print("选择排序后的数组为:");
Array.display(arr);
System.out.println();
// 插入排序
Array.insertSort(arr);
System.out.print("插入排序后的数组为:");
Array.display(arr);
System.out.println();
// 希尔排序
Array.shellSort(arr);
System.out.print("希尔排序后的数组为:");
Array.display(arr);
}
public static void bubbleSort(int[] arr) {
int temp;
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
public static void selectSort(int[] arr) {
for (int i = 0; i < arr.length - 1; i++) {
for (int j = i + 1; j < arr.length; j++) {
if (arr[i] < arr[j]) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
}
public static void insertSort(int[] arr) {
int j;
for (int i = 1; i < arr.length; i++) {
int temp = arr[i];
for (j = i; j > 0 && temp < arr[j - 1]; j--) {
arr[j] = arr[j - 1];
}
arr[j] = temp;
}
}
public static void shellSort(int[] arr) {
int j;
for (int gap = arr.length / 2; gap > 0; gap /= 2) {
for (int i = gap; i < arr.length; i++) {
int temp = arr[i];
for (j = i; j >= gap && temp < arr[j - gap]; j -= gap) {
arr[j] = arr[j - gap];
}
arr[j] = temp;
}
}
}
public static void display(int[] arr) {
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
}
}