* 甯屽皵鎺掑簭
* @author sikaijian
*/
public class ShellSort {
public static void sort(int[] data){
int d = data.length/2;
while(d!=0){
directInsertSort(data, d);
d/=2;
}
}
/**
* 甯﹀閲忕殑鐩存帴鎻掑叆鎺掑簭
* @param data 寰呮帓搴忔暟緇?br /> * @param d 澧為噺
*/
private static void directInsertSort(int[] data, int d){
int len = data.length;
for(int i=0; i+d<len; i++){
int pCurrent = i+d;
int left = i-1;
while(pCurrent<len){
int front = pCurrent-d;
int key = data[pCurrent];
while(front>left && data[front]>key){
data[front+d] = data[front];
front-=d;
}
data[front+d] = key;
pCurrent+=d;
}
}
}
public static void showArray(int[] array){
for (int t : array) {
System.out.print(t);
System.out.print(" ");
}
}
/**
* 嫻嬭瘯浠ｇ爜
* @param args
*/
public static void main(String[] args) {
int[] data = new int[] { 49, 23, 65, 13, 38, 96, 12, 33, 88, 123, 22,
11, 9, 55, 111, 0 };
showArray(data);
System.out.println();
System.out.println("------------------------------");
ShellSort.sort(data);
showArray(data);
}
}
]]>
* 鐩存帴鎻掑叆鎺掑簭
* @author sikaijian
*/
public class DirectInsertSort {
public static void sort(int[] data){
int pCurrent = 1; // 璁ゅ畾絎?涓暟鏄湁搴忕殑錛屼粠絎?涓暟寮濮嬫彃鍏ユ帓搴?/span>
int n = data.length;
while(pCurrent<n){
int front = pCurrent-1;
int key = data[pCurrent];
// 褰撳墠瑕佹彃鍏ョ殑鏁板拰宸﹁竟鐨勬湁搴忛槦鍒楁瘮杈冿紙浠庡彸寰宸︽瘮杈冿紝姣旇緝涓嬈＄Щ鍔ㄤ竴嬈★級
while(front>-1 && key<data[front]){
data[front+1] = data[front];
front--;
}
data[front+1] = key;
pCurrent++;
}
}
/**
* 嫻嬭瘯浠ｇ爜
* @param args
*/
public static void main(String[] args) {
int[] data = new int[] { 49, 23, 65, 13, 38, 96, 12, 33, 88, 123, 22,
11, 9, 55, 111, 0 };
for (int t : data) {
System.out.print(t);
System.out.print(" ");
}
System.out.println();
System.out.println("------------------------------");
DirectInsertSort.sort(data);
for (int t : data) {
System.out.print(t);
System.out.print(" ");
}
}
}
]]>
/**
* 鍐掓場鎺掑簭
* @author sikaijian
*/
public class BubbleSort {
public static void sort(int[] data){
if(data.length<=1) return;
/**
* 姣忎竴瓚熸帓搴忛兘鎶婃渶澶х殑鏁板瓧鏀懼埌鏈鍚?/div>
for (int j = 0; j < i; j++) {
if(data[j]>data[j+1]){
int temp = data[j];
data[j] = data[j+1];
data[j+1] = temp;
}
}
}
}
/**
* 嫻嬭瘯浠ｇ爜
* @param args
*/
public static void main(String[] args) {
int[] data = new int[] { 49, 23, 65, 13, 38, 96, 12, 33, 88, 123, 22,
11, 9, 55, 111, 0 };
for (int t : data) {
System.out.print(t);
System.out.print(" ");
}
System.out.println();
System.out.println("------------------------------");
BubbleSort.sort(data);
for (int t : data) {
System.out.print(t);
System.out.print(" ");
}
}
}
* 涓嬩竴瓚熸帓搴忓悗錛屾渶澶х殑鏁頒笉鍙傚姞
* 鎬誨叡n-1瓚燂紙n涓烘暟緇勯暱搴︼級
*/
for (int i = data.length-1; i > 0; i--) {for (int j = 0; j < i; j++) {
if(data[j]>data[j+1]){
int temp = data[j];
data[j] = data[j+1];
data[j+1] = temp;
}
}
}
}
/**
* 嫻嬭瘯浠ｇ爜
* @param args
*/
public static void main(String[] args) {
int[] data = new int[] { 49, 23, 65, 13, 38, 96, 12, 33, 88, 123, 22,
11, 9, 55, 111, 0 };
for (int t : data) {
System.out.print(t);
System.out.print(" ");
}
System.out.println();
System.out.println("------------------------------");
BubbleSort.sort(data);
for (int t : data) {
System.out.print(t);
System.out.print(" ");
}
}
}
]]>
* @author sikaijian
*/
public class QuickSort {
/**
* 蹇熸帓搴忕畻娉曞疄鐜?br /> * @param data 寰呮帓搴忔暟緇?br /> * @param left 宸﹁竟鐣?nbsp;鍒濆0
* @param right 鍙寵竟鐣?nbsp;鍒濆鏁扮粍闀垮害-1
* @author sikaijian
*/
public static void sort(int[] data, int left, int right) {
if (left > right)
return;
int pHead = left; // 澶撮儴鎸囬拡
int pTail = right; // 灝鵑儴鎸囬拡
int key = data[left]; // 鍝ㄥ叺
while (pHead < pTail) {
// 浠庡彸寰宸﹂亶鍘嗭紝鎵懼埌姣攌ey灝忕殑鏁幫紝鏀懼埌鍓嶉潰
while (pHead < pTail && data[pTail] > key) pTail--;
if (pHead < pTail) data[pHead++] = data[pTail];
// 浠庡乏寰鍙抽亶鍘嗭紝鎵懼埌姣攌ey澶х殑鏁幫紝鏀懼埌鍚庨潰
while (pHead < pTail && data[pHead] < key) pHead++;
if (pHead < pTail) data[pTail--] = data[pHead];
}
data[pHead] = key; // 褰掍綅
sort(data, left, pHead-1); // 鎺掑簭宸﹁竟鐨勬暟緇?/span>
sort(data, pHead+1, right); // 鎺掑簭鍙寵竟鐨勬暟緇?/span>
}
/**
* 嫻嬭瘯浠ｇ爜
* @param args
*/
public static void main(String[] args) {
int[] data = new int[] { 49, 23, 65, 13, 38, 96, 12, 33, 88, 123, 22,
11, 9, 55 };
for (int t : data) {
System.out.print(t);
System.out.print(" ");
}
System.out.println();
System.out.println("------------------------------");
QuickSort.sort(data, 0, data.length - 1);
for (int t : data) {
System.out.print(t);
System.out.print(" ");
}
}
}
]]>