第 43 天: 插入排序

插入排序是简单直接的排序方式之一，每次保证前 i 个数据是有序的

package day40;

public class DataArray {

	class DataNode{
		int key;
		String content;	
		DataNode(int parakey, String paraContent){
			key = parakey;
			content = paraContent;
		}//Of the second constructor
	    public String toString() {
	    	return "(" + key + ", " + content + ") ";
	    }// Of toString
	}// Of class DataNode
	
	DataNode[] data;
	int length;
	
	public DataArray(int[] paraKeyArray, String[]paraContentArray) {
		length = paraKeyArray.length;
		data = new DataNode[length];
		
		for(int i = 0; i < length; i++) {
			data[i] = new DataNode(paraKeyArray[i], paraContentArray[i]);
		}// Of for i
	}// Of the first constructor
	
	public String toString() { 
		String resultString = "I am a data array with " + length + " items.\r\n";
		for(int i = 0; i < length ;i++) {
			resultString += data[i] +" ";
		}//Of for i
		return resultString;
	}//Of toString
	
	public String sequentialSearch(int paraKey) {
		data[0].key = paraKey;
		int i ;
		for(i = length - 1; data[i].key !=paraKey; i--) {
			;
		}//Of for i
		return data[i].content;
	}// Of sequentialSearch
	
	public static void sequentialSearchTest() {
		int[] tempUnsortedKeys = { -1, 5, 3, 6, 10, 7, 1, 9 };
		String[] tempContents = { "null", "if", "then", "else", "switch", "case", "for", "while" };
		DataArray tempDataArray = new DataArray(tempUnsortedKeys, tempContents);

		System.out.println(tempDataArray);

		System.out.println("Search result of 10 is: " + tempDataArray.sequentialSearch(10));
		System.out.println("Search result of 5 is: " + tempDataArray.sequentialSearch(5));
		System.out.println("Search result of 4 is: " + tempDataArray.sequentialSearch(4));
	}// Of sequentialSearchTest
	
	public String binarySearch(int paraKey) {
		int tempLeft = 0;
		int tempRight = length - 1;
		int tempMiddle = (tempLeft + tempRight) / 2;
		
		while(tempLeft <= tempRight) {
			tempMiddle = (tempLeft + tempRight) / 2;
			if(data[tempMiddle].key == paraKey) {
				return data[tempMiddle].content;
			}else if(data[tempMiddle].key <= paraKey) {
				tempLeft = tempMiddle + 1;
			}else {
				tempRight = tempMiddle - 1;
			}//Of if
		}//Of while
		
		return "null";
	}//Of binarySearch
	
	public static void binarySearchTest() {
		int[] tempSortedKeys = { 1, 3, 5, 6, 7, 9, 10 };
		String[] tempContents = { "if", "then", "else", "switch", "case", "for", "while" };
		DataArray tempDataArray = new DataArray(tempSortedKeys, tempContents);

		System.out.println(tempDataArray);

		System.out.println("Search result of 10 is: " + tempDataArray.binarySearch(10));
		System.out.println("Search result of 5 is: " + tempDataArray.binarySearch(5));
		System.out.println("Search result of 4 is: " + tempDataArray.binarySearch(4));
	}// Of binarySearchTest

	public DataArray(int[] paraKeyArray, String[] paraContentArray, int paraLength) {
		length = paraLength;
		data = new DataNode[length];
		for(int i = 0; i < length; i++) {
			data[i] = null;
		}//Of for i
		int tempPosition;
		for(int i = 0; i < paraKeyArray.length; i++) {
			tempPosition = paraKeyArray[i] % paraLength;
			while(data[tempPosition] != null) {
				tempPosition = (tempPosition + 1) % paraLength;
				System.out.println("Collision, move forward for key " + paraKeyArray[i]);
			}//Of while
		    data[tempPosition] = new DataNode(paraKeyArray[i], paraContentArray[i]);
		}//Of for i
	}//Of the second constructor
	
	public String hashSearch(int paraKey) {
		int tempPosition = paraKey % length;
		while(data[tempPosition] !=null) {
			if(data[tempPosition].key == paraKey) {
				return data[tempPosition].content;
			}//Of if
			System.out.println("Not this one for " + paraKey);
			tempPosition = (tempPosition + 1) % length;
		}//Of while
		return "null";
	}//Of hashSearch
	
	public static void hashSearchTest() {
		int[] tempUnsortedKeys = { 16, 33, 38, 69, 57, 95, 86 };
		String[] tempContents = { "if", "then", "else", "switch", "case", "for", "while" };
		DataArray tempDataArray = new DataArray(tempUnsortedKeys, tempContents, 19);

		System.out.println(tempDataArray);

		System.out.println("Search result of 95 is: " + tempDataArray.hashSearch(95));
		System.out.println("Search result of 38 is: " + tempDataArray.hashSearch(38));
		System.out.println("Search result of 57 is: " + tempDataArray.hashSearch(57));
		System.out.println("Search result of 4 is: " + tempDataArray.hashSearch(4));
	}//Of hashSearchTest
	public void insertionSort() { 
		DataNode tempNode;
		int j;
		for(int i = 2; i < length; i++) {
			tempNode = data[i];
			for(j = i - 1; data[j].key > tempNode.key; j--) {
				data[j + 1] = data[j];
			}//Of for j
			data[j + 1] = tempNode;
			
			System.out.println("Round " + (i - 1));
			System.out.println(this);
		}//Of for i
	}//Of insertionSort
	
	public static void insertionSortTest() {
		int[] tempUnsortedKeys = { -100, 5, 3, 6, 10, 7, 1, 9 };
		String[] tempContents = { "null", "if", "then", "else", "switch", "case", "for", "while" };
		DataArray tempDataArray = new DataArray(tempUnsortedKeys, tempContents);

		System.out.println(tempDataArray);

		tempDataArray.insertionSort();
		System.out.println("Result\r\n" + tempDataArray);
	}// Of insertionSortTest
	
	public static void main(String[] args) {
		System.out.println("\r\n-------sequentialSearchTest-------");
		sequentialSearchTest();

		System.out.println("\r\n-------binarySearchTest-------");
		binarySearchTest();
		
		System.out.println("\r\n-------hashSearchTest-------");
		hashSearchTest();
		
		insertionSortTest();
	}//Of main

}//Of class DataArray

运行截图：