package com.luojie;
/**
*
* @author Brandon 練習排序算法
*/
public class SortUtil {
public static int totalNum = 12;
static int initNum[] = new int[totalNum];
public static void main(String[] args) {
for (int i = 0; i < totalNum; i++) {
initNum[i] = (int) (Math.random() * 100);
}
printNum(initNum);
System.out.println("++++++++++++++++++++++++++++");
sortAlgorithm7(initNum);
printNum(initNum);
}
// 冒泡排序
public static void sortAlgorithm1(int initNum[]) {
int temp = -1;
for (int i = 0; i < initNum.length; i++) {
for (int j = 0; j < initNum.length - i - 1; j++) {
if (initNum[j] > initNum[j + 1]) {
temp = initNum[j];
initNum[j] = initNum[j + 1];
initNum[j + 1] = temp;
}
}
}
}
// 選擇排序
public static void sortAlgorithm2(int initNum[]) {
int max = 0;
int temp = -1;
for (int i = initNum.length - 1; i >= 0; i--) {
max = 0;
for (int j = 0; j <= i; j++) {
if (initNum[j] > initNum[max]) {
max = j;
}
}
temp = initNum[i];
initNum[i] = initNum[max];
initNum[max] = temp;
}
}
// 插入排序,插入之前有序的隊列中
public static void sortAlgorithm3(int initNum[]) {
int temp = 0;
int j = 0;
for (int i = 1; i < initNum.length; i++) {
temp = initNum[i];
j = i;
while (j > 0 && initNum[j - 1] > temp) {
initNum[j] = initNum[j - 1];
j--;
}
initNum[j] = temp;
}
}
// 希爾排序,直接在插入排序的基礎上加一個步長就可以了
public static void sortAlgorithm4(int initNum[]) {
int temp = 0;
int j = 0;
for (int g = initNum.length / 2; g > 0; g = g / 2) {
for (int i = g; i < initNum.length; i += g) {
temp = initNum[i];
j = i;
while (j > 0 && initNum[j - g] > temp) {
initNum[j] = initNum[j - g];
j -= g;
}
initNum[j] = temp;
}
}
}
// 快速排序,快速定位某個數字的具體位置,分製法
public static void sortAlgorithm5(int initNum[]) {
quickSort(initNum, 0, initNum.length - 1);
}
public static void quickSort(int initNum[], int left, int right) {
if (left < right) {
int low = left;
int high = right;
int temp = initNum[left];
while (low < high) {
while (low < high && initNum[high] >= temp) {// 注意中間的那個等號,不然會產生死循環最後走不出來
high--;
}
initNum[low] = initNum[high];
while (low < high && initNum[low] <= temp) {
low++;
}
initNum[high] = initNum[low];
}
initNum[high] = temp;
quickSort(initNum, left, low - 1);
quickSort(initNum, low + 1, right);
}
}
// 堆排序,重要的是那個輔助方法,將一個數字插入大頂堆中
public static void sortAlgorithm6(int initNum[]) {
int temp = 0;
// 第一步:生成堆
for (int i = initNum.length / 2 - 1; i >= 0; i--) {
insertMethed(initNum, i, initNum.length - 1);
}
for (int j = initNum.length - 1; j >= 0; j--) {
temp = initNum[j];
initNum[j] = initNum[0];
initNum[0] = temp;
insertMethed(initNum, 0, j);
}
// 第二步:循環交換,在循環中將其新加入堆數字進行排序
}
// 輔助方法
public static void insertMethed(int initNum[], int startNode, int endNode) {
if (startNode < endNode) {
int leftNode = startNode * 2 + 1;
int rightNode = startNode * 2 + 2;
int maxNode = startNode;
int temp = 0;
if (leftNode < endNode && initNum[leftNode] > initNum[maxNode]) {
maxNode = leftNode;
}
if (rightNode < endNode && initNum[rightNode] > initNum[maxNode]) {
maxNode = rightNode;
}
if (maxNode != startNode) {
temp = initNum[maxNode];
initNum[maxNode] = initNum[startNode];
initNum[startNode] = temp;
}
insertMethed(initNum, leftNode, endNode);
insertMethed(initNum, rightNode, endNode);
}
}
// 歸併排序,關鍵點是將兩個有序數組合併成爲一個有序數組
public static void sortAlgorithm7(int intNum[]) {
recursionMethed(initNum, 0, initNum.length - 1);
}
// 遞歸
public static void recursionMethed(int initNum[], int left, int right) {
int temp = (left + right) / 2;
if (left < right) {
recursionMethed(initNum, left, temp);
recursionMethed(initNum, temp + 1, right);
mergeMethed(initNum, left, temp, right);
}
}
// 合併方法,只適合相鄰堆兩個有序堆數組
public static void mergeMethed(int initNum[], int start, int middle, int end) {
int low1 = start;
int low2 = middle + 1;
int k = 0;
int initTemp[] = new int[end - start + 1];
while (low1 <= middle && low2 <= end) {
if (initNum[low1] <= initNum[low2]) {
initTemp[k] = initNum[low1];
low1++;
k++;
} else {
initTemp[k] = initNum[low2];
low2++;
k++;
}
}
while (low1 <= middle && low2 > end) {
initTemp[k] = initNum[low1];
low1++;
k++;
}
while (low1 > middle && low2 <= end) {
initTemp[k] = initNum[low2];
low2++;
k++;
}
for (int i = 0; i < initTemp.length; i++, start++) {
initNum[start] = initTemp[i];
}
}
public static void printNum(int initNum[]) {
for (int i = 0; i < initNum.length; i++) {
System.out.println(initNum[i]);
}
}
}
7種排序算法(java)——第四遍
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.