int[] arr = { 2, 7, 33, 22, 83, 21, 200, 53, 332 };
int temp, i, j;
/**
* 冒泡排序
*
* @param args
*/
for (i = arr.length - 1; i >= 0; i--) {
for (j = 0; j < i; j++) {// j<i ,j<=i --->bug
if (arr[j] > arr[j + 1]) {// arrayindex out of bound //
// exception
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}// for
/**
* 简单选择排序
*/
for (i = 0; i < arr.length; i++) {
int index = i;
for (j = i + 1; j < arr.length; j++) {
if (arr[i] > arr[j]) {
// arr[index] = arr[j]; 必须交换,否则结果不一致,分析步骤;
index = j;
temp = arr[index];
arr[index] = arr[i];
arr[i] = temp;
}
}
}
}
/**
* 快速排序
*/
public static void quicksort(int arr[], int low, int high) {
int i = low;
int j = high;
int shuzhou;
// 2, 7, 33, 22, 83, 21, 200, 53, 332
if (low < high) {
shuzhou = arr[low];
while (i != j) {
while (i < j && arr[j] > shuzhou)
// 从右往左扫描
--j;
if (i < j) {
arr[i] = arr[j];
++i;
}
while (i < j && arr[i] < shuzhou)
// 从左往右扫描
++i;
if (i < j) {
arr[j] = arr[i];
--j;
}
}
arr[i] = shuzhou;
// quicksort(arr, 0, i);
// quicksort(arr, i + 1, arr.length -
// 1);//java.lang.StackOverflowError
quicksort(arr, low, i);
quicksort(arr, i + 1, high);
}
}
直接插入排序:
public static void insertsort(int arr[], int high, int low) {
int temp = 0;
/*
* for (int i = arr.length - 1; i > 0; i--) {// 直接插入排序不能跟冒泡排序的思想混为一谈
* for (int j = 1; j < i; j++) { if (arr[i] < arr[j]) { arr[j + 1] =
* arr[j]; }
*
* }
*/
// int[] arr = { 2, 7, 33, 22, 83, 21, 200, 53, 332 };
int j = 0;
for (int i = 1; i < arr.length; i++) {
temp = arr[i];
j = i - 1;
while (j > 0 && arr[j] > temp) {// while 语句 替代 for 语句 很重要
arr[j + 1] = arr[j];
j--;
}
arr[j + 1] = temp;
}
}
}