`
knight_black_bob
  • 浏览: 851102 次
  • 性别: Icon_minigender_1
  • 来自: 北京
社区版块
存档分类
最新评论

排序 九大排序

阅读更多

 



 

 

 

 

 

 

package sort;

public class DataWrap implements Comparable<DataWrap>{
	int data;
	String flag;
	public DataWrap(int data,String flag){
		this.data = data;
		this.flag = flag;
	}
	public String toString(){
		return data + flag;
	}
	//根据data实例变量来决定两个dataWrap的大小
	@Override
	public int compareTo(DataWrap dw) {
		return this.data > dw.data? 1 : (this.data == dw.data? 0 : -1);
	}
	
}

 

直接插入排序

package sort;

/**
 * 直接插入排序
 * @author shkstart
 * 2013-11-27
 */
public class InsertSort {
	public static void insertSort(DataWrap[] data){
		System.out.println("开始排序");
		int arrayLength = data.length;
		for(int i = 1;i < arrayLength;i++){
			DataWrap temp = data[i];
			if(data[i].compareTo(data[i-1]) < 0){
				int j = i -1;
				for(;j >= 0 && data[j].compareTo(temp) > 0;j--){
					data[j +1] = data[j];
				}
				data[j + 1] = temp;
			}
			System.out.println(java.util.Arrays.toString(data));
		}
		
	}
	public static void main(String[] args) {
		DataWrap[] data = { new DataWrap(9, ""), new DataWrap(-16, ""),
				new DataWrap(21, "*"), new DataWrap(23, ""),
				new DataWrap(-30, ""), new DataWrap(-49, ""),
				new DataWrap(21, ""), new DataWrap(30, "*"),
				new DataWrap(30, "")};
		System.out.println("排序之前:\n" + java.util.Arrays.toString(data));
		insertSort(data);
		System.out.println("排序之后:\n" + java.util.Arrays.toString(data));
	}
}

 

 折半插入排序

package sort;
/**
 * 折半插入排序
 * @author shkstart
 * 2013-11-27
 */

public class BinaryInsertSort {
	public static void binaryInsertSort(DataWrap[] data) {
		System.out.println("开始排序");
		int arrayLength = data.length;
		for (int i = 1; i < arrayLength; i++) {
			DataWrap temp = data[i];
			int low = 0;
			int high = i - 1;
			while (low <= high) {
				int mid = (low + high) / 2;
				if (temp.compareTo(data[mid]) > 0) {
					low = mid + 1;
				} else {
					high = mid - 1;
				}
			}
			for (int j = i; j > low; j--) {
				data[j] = data[j - 1];
			}
			data[low] = temp;
			System.out.println(java.util.Arrays.toString(data));
		}

	}

	public static void main(String[] args) {
		DataWrap[] data = { new DataWrap(9, ""), new DataWrap(-16, ""),
				new DataWrap(21, "*"), new DataWrap(23, ""),
				new DataWrap(-30, ""), new DataWrap(-49, ""),
				new DataWrap(21, ""), new DataWrap(30, "*"),
				new DataWrap(30, "")};
		System.out.println("排序之前:\n" + java.util.Arrays.toString(data));
		binaryInsertSort(data);
		System.out.println("排序之后:\n" + java.util.Arrays.toString(data));
	}
}

 

 

Shell排序

package sort;
/**
 * Shell排序
 * @author shkstart
 * 2013-11-27
 */

public class ShellSort {
	public static void ShellSort(DataWrap[] data) {
		System.out.println("开始排序");
		int arrayLength = data.length;

		int h = 1;
		while (h <= arrayLength / 3) {
			h = h * 3 + 1;
		}
		while (h > 0) {
			System.out.println("===h的值:" + h + "===");
			for (int i = h; i < arrayLength; i++) {
				DataWrap temp = data[i];
				if (data[i].compareTo(data[i - h]) < 0) {
					int j = i - h;
					for (; j >= 0 && data[j].compareTo(temp) > 0; j -= h) {
						data[j + h] = data[j];
					}
					data[j + h] = temp;
				}
				System.out.println(java.util.Arrays.toString(data));
			}
			h = (h - 1) / 3;
		}
	}

	public static void main(String[] args) {
		DataWrap[] data = { 
				new DataWrap(9, ""), new DataWrap(-16, ""),
				new DataWrap(21, "*"), new DataWrap(23, ""),
				new DataWrap(-30, ""), new DataWrap(-49, ""),
				new DataWrap(21, ""), new DataWrap(30, "*"),
				new DataWrap(30, "")};
		System.out.println("排序之前:\n" + java.util.Arrays.toString(data));
		ShellSort(data);
		System.out.println("排序之后:\n" + java.util.Arrays.toString(data));
	}
}

 

直接选择排序

package sort;


/**
 * 直接选择排序
 * @author shkstart
 * 2013-11-27
 */
public class SelectSort {
	public static void selectSort(DataWrap[] data) {
		System.out.println("开始排序");
		int arrayLength = data.length;
		for (int i = 0; i < arrayLength - 1; i++) {
			for (int j = i + 1; j < arrayLength; j++) {
				if (data[i].compareTo(data[j]) > 0) {
					DataWrap temp = data[i];
					data[i] = data[j];
					data[j] = temp;
				}
			}
			System.out.println(java.util.Arrays.toString(data));
		}
	}

	public static void main(String[] args) {
		DataWrap[] data = { new DataWrap(9, ""), new DataWrap(-16, ""),
				new DataWrap(21, "*"), new DataWrap(23, ""),
				new DataWrap(-30, ""), new DataWrap(-49, ""),
				new DataWrap(21, ""), new DataWrap(30, "*"),
				new DataWrap(30, "") };
		System.out.println("排序之前:\n" + java.util.Arrays.toString(data));
		selectSort(data);
		System.out.println("排序之后:\n" + java.util.Arrays.toString(data));
	}
}

 

直接选择排序-改进

package sort;

/**
 * 直接选择排序-改进
 * @author shkstart
 * 2013-11-27
 */
public class SelectSort2 {
	public static void selectSort(DataWrap[] data) {
		System.out.println("开始排序");
		int arrayLength = data.length;
		for (int i = 0; i < arrayLength - 1; i++) {
			int minIndex = i;
			for (int j = i + 1; j < arrayLength; j++) {
				if (data[minIndex].compareTo(data[j]) > 0) {
					minIndex = j;
					
				}
			}
			if(minIndex != i){
				DataWrap temp = data[i];
				data[i] = data[minIndex];
				data[minIndex] = temp;
			}
			System.out.println(java.util.Arrays.toString(data));
		}
	}

	public static void main(String[] args) {
		DataWrap[] data = { new DataWrap(9, ""), new DataWrap(-16, ""),
				new DataWrap(21, "*"), new DataWrap(23, ""),
				new DataWrap(-30, ""), new DataWrap(-49, ""),
				new DataWrap(21, ""), new DataWrap(30, "*"),
				new DataWrap(30, "") };
		System.out.println("排序之前:\n" + java.util.Arrays.toString(data));
		selectSort(data);
		System.out.println("排序之后:\n" + java.util.Arrays.toString(data));
	}
}

 

 

堆排序

package sort;

/**
 * 堆排序
 * @author shkstart
 * 2013-11-27
 */
public class HeapSort {
	public static void heapSort(DataWrap[] data) {
		System.out.println("开始排序");
		int arrayLength = data.length;
		// 循环建堆
		for (int i = 0; i < arrayLength - 1; i++) {
			// 建堆
			builMaxdHeap(data, arrayLength - 1 - i);
			// 交换堆顶和最后一个元素
			swap(data, 0, arrayLength - 1 - i);
			System.out.println(java.util.Arrays.toString(data));
		}
	}

	// 对data数组从0到lastIndex建大顶堆
	private static void builMaxdHeap(DataWrap[] data, int lastIndex) {
		// 从lastIndex处节点(最后一个节点)的父节点开始
		for (int i = (lastIndex - 1) / 2; i >= 0; i--) {
			// k保存当前正在判断的节点
			int k = i;
			// 如果当前k节点的子节点存在
			while (k * 2 + 1 <= lastIndex) {
				// k节点的左子节点的索引
				int biggerIndex = 2 * k + 1;
				// 如果biggerIndex小于lastIndex,即biggerIndex +1
				// 代表k节点的右子节点存在
				if (biggerIndex < lastIndex) {
					// 如果右子节点的值较大
					if (data[biggerIndex].compareTo(data[biggerIndex + 1]) < 0) {
						// biggerIndex总是记录较大子节点的索引
						biggerIndex++;
					}
				}
				// 如果k节点的值小于其较大子节点的值
				if (data[k].compareTo(data[biggerIndex]) < 0) {
					// 交换它们
					swap(data, k, biggerIndex);
					// 将biggerIndex赋给k,开始while循环的下一次循环
					// 重新保证k节点的值大于其左、右节点的值
					k = biggerIndex;
				} else {
					break;
				}
			}
		}
	}

	// 交换data数组中i、j两个索引处的元素
	private static void swap(DataWrap[] data, int i, int j) {
		DataWrap temp = data[i];
		data[i] = data[j];
		data[j] = temp;
	}

	public static void main(String[] args) {
		DataWrap[] data = { new DataWrap(9, ""), new DataWrap(-16, ""),
				new DataWrap(21, "*"), new DataWrap(23, ""),
				new DataWrap(-30, ""), new DataWrap(-49, ""),
				new DataWrap(21, ""), new DataWrap(30, "*"),
				new DataWrap(30, "")};
		System.out.println("排序之前:\n" + java.util.Arrays.toString(data));
		heapSort(data);
		System.out.println("排序之后:\n" + java.util.Arrays.toString(data));
	}
}

 

冒泡排序

package sort;

/**
 * 冒泡排序
 * @author shkstart
 * 2013-11-27
 */
public class BubbleSort {
	public static void bubbleSort(DataWrap[] data) {
		System.out.println("开始排序");
		int arrayLength = data.length;
		for (int i = 0; i < arrayLength - 1; i++) {
			boolean flag = false;
			for (int j = 0; j < arrayLength - 1 - i; j++) {
				if (data[j].compareTo(data[j + 1]) > 0) {
					DataWrap temp = data[j + 1];
					data[j + 1] = data[j];
					data[j] = temp;
					flag = true;
				}
			}
			System.out.println(java.util.Arrays.toString(data));
			if (!flag)
				break;
		}
	}

	public static void main(String[] args) {
		DataWrap[] data = { new DataWrap(9, ""), new DataWrap(-16, ""),
				new DataWrap(21, "*"), new DataWrap(23, ""),
				new DataWrap(-30, ""), new DataWrap(-49, ""),
				new DataWrap(21, ""), new DataWrap(30, "*"),
				new DataWrap(30, "")};
		System.out.println("排序之前:\n" + java.util.Arrays.toString(data));
		bubbleSort(data);
		System.out.println("排序之后:\n" + java.util.Arrays.toString(data));
	}
}

 

快速排序 

package sort;

/**
 * 快速排序
 * @author shkstart
 * 2013-11-27
 */
public class QuickSort {
	private static void swap(DataWrap[] data, int i, int j) {
		DataWrap temp = data[i];
		data[i] = data[j];
		data[j] = temp;
	}

	private static void subSort(DataWrap[] data, int start, int end) {
		if (start < end) {
			DataWrap base = data[start];
			int i = start;
			int j = end + 1;
			while (true) {
				while (i < end && data[++i].compareTo(base) <= 0)
					;
				while (j > start && data[--j].compareTo(base) >= 0)
					;
				if (i < j) {
					swap(data, i, j);
				} else {
					break;
				}
			}
			swap(data, start, j);
			subSort(data, start, j - 1);
			subSort(data, j + 1, end);
		}
	}
	public static void quickSort(DataWrap[] data){
		subSort(data,0,data.length-1);
	}
	public static void main(String[] args) {
		DataWrap[] data = { new DataWrap(9, ""), new DataWrap(-16, ""),
				new DataWrap(21, "*"), new DataWrap(23, ""),
				new DataWrap(-30, ""), new DataWrap(-49, ""),
				new DataWrap(21, ""), new DataWrap(30, "*"),
				new DataWrap(30, "") };
		System.out.println("排序之前:\n" + java.util.Arrays.toString(data));
		quickSort(data);
		System.out.println("排序之后:\n" + java.util.Arrays.toString(data));
	}
}

 

 归并排序

package sort;

/**
 * 归并排序
 * 
 * @author shkstart 
 * 2013-11-27
 */
public class MergeSort {
	public static void mergeSort(DataWrap[] data) {
		// 归并排序
		sort(data, 0, data.length - 1);
	}

	// 将索引从left到right范围的数组元素进行归并排序
	private static void sort(DataWrap[] data, int left, int right) {
		if(left < right){
			//找出中间索引
			int center = (left + right)/2;
			sort(data,left,center);
			sort(data,center+1,right);
			//合并
			merge(data,left,center,right);
		}
	}

	// 将两个数组进行归并,归并前两个数组已经有序,归并后依然有序
	private static void merge(DataWrap[] data, int left, int center, int right) {
		DataWrap[] tempArr = new DataWrap[data.length];
		int mid = center + 1;
		int third = left;
		int temp = left;
		while (left <= center && mid <= right) {
			if (data[left].compareTo(data[mid]) <= 0) {
				tempArr[third++] = data[left++];
			} else {
				tempArr[third++] = data[mid++];
			}
		}
		while (mid <= right) {
			tempArr[third++] = data[mid++];
		}
		while (left <= center) {
			tempArr[third++] = data[left++];
		}
		while (temp <= right) {
			data[temp] = tempArr[temp++];
		}
	}

	public static void main(String[] args) {
		DataWrap[] data = { new DataWrap(9, ""), new DataWrap(-16, ""),
				new DataWrap(21, "*"), new DataWrap(23, ""),
				new DataWrap(-30, ""), new DataWrap(-49, ""),
				new DataWrap(21, ""), new DataWrap(30, "*"),
				new DataWrap(30, "") };
		System.out.println("排序之前:\n" + java.util.Arrays.toString(data));
		mergeSort(data);
		System.out.println("排序之后:\n" + java.util.Arrays.toString(data));
	}
}

 

基数排序  

package sort;

import java.util.Arrays;

/**
 * 基数排序
 * 
 * @author shkstart 2013-11-27
 */
public class MultiKeyRadixSort {
	public static void radixSort(int[] data, int radix, int d) {
		System.out.println("开始排序:");
		int arrayLength = data.length;
		int[] temp = new int[arrayLength];
		int[] buckets = new int[radix];
		for (int i = 0, rate = 1; i < d; i++) {
			// 重置count数组,开始统计第二个关键字
			Arrays.fill(buckets, 0);
			// 当data数组的元素复制到temp数组中进行缓存
			System.arraycopy(data, 0, temp, 0, arrayLength);
			for (int j = 0; j < arrayLength; j++) {
				int subKey = (temp[j] / rate) % radix;
				buckets[subKey]++;
			}
			for (int j = 1; j < radix; j++) {
				buckets[j] = buckets[j] + buckets[j - 1];
			}
			for (int m = arrayLength - 1; m >= 0; m--) {
				int subKey = (temp[m] / rate) % radix;
				data[--buckets[subKey]] = temp[m];
			}
			System.out.println("对" + rate + "位上子关键字排序:"
					+ java.util.Arrays.toString(data));
			rate *= radix;
		}
	}

	public static void main(String[] args) {
		int[] data = { 1100, 192, 221, 12, 13 };
		System.out.println("排序之前:\n" + java.util.Arrays.toString(data));
		radixSort(data, 10, 4);
		System.out.println("排序之后:\n" + java.util.Arrays.toString(data));
	}
}

  

桶式排序 

package sort;

import java.util.Arrays;

/**
 * 桶式排序
 * 
 * @author shkstart 
 * 2013-11-27
 */
public class BucketSort {
	public static void bucketSort(DataWrap[] data, int min, int max) {
		System.out.println("开始排序");
		int arrayLength = data.length;
		DataWrap[] temp = new DataWrap[arrayLength];
		int[] buckets = new int[max - min];
		for (int i = 0; i < arrayLength; i++) {
			buckets[data[i].data - min]++;
		}
		System.out.println(Arrays.toString(buckets));
		for (int i = 1; i < max - min; i++) {
			buckets[i] = buckets[i] + buckets[i - 1];
		}
		System.out.println(Arrays.toString(buckets));
		System.arraycopy(data, 0, temp, 0, arrayLength);
		for (int k = arrayLength - 1; k >= 0; k--) {
			data[--buckets[temp[k].data - min]] = temp[k];
		}
	}

	public static void main(String[] args) {
		DataWrap[] data = { new DataWrap(9, ""), new DataWrap(5, ""),
				new DataWrap(-1, ""), new DataWrap(8, ""),
				new DataWrap(5, "*"), new DataWrap(7, ""),
				new DataWrap(3, ""), new DataWrap(-3, ""),
				new DataWrap(1, ""),new DataWrap(3, "*")};
		System.out.println("排序之前:\n" + java.util.Arrays.toString(data));
		bucketSort(data, -3, 10);
		System.out.println("排序之后:\n" + java.util.Arrays.toString(data));
	}
}

  

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

捐助开发者

在兴趣的驱动下,写一个免费的东西,有欣喜,也还有汗水,希望你喜欢我的作品,同时也能支持一下。 当然,有钱捧个钱场(右上角的爱心标志,支持支付宝和PayPal捐助),没钱捧个人场,谢谢各位。



 
 
 谢谢您的赞助,我会做的更好!

 

 

 

  • 大小: 51.3 KB
  • 大小: 36.5 KB
  • 大小: 93.9 KB
  • 大小: 274.4 KB
  • 大小: 96.5 KB
  • 大小: 13.1 KB
  • 大小: 90.8 KB
  • 大小: 13.1 KB
  • 大小: 741 KB
分享到:
评论

相关推荐

Global site tag (gtag.js) - Google Analytics