java学习第46天，快速排序

于 2021-07-08 11:06:16 发布
阅读量86 收藏
点赞数
分类专栏： java的学习之路 文章标签： java 算法
原文链接：https://blog.csdn.net/qq_15346435/article/details/118523223
版权
  1. 平均时间复杂度为O(nlogn)，但最坏情况还是O(n^2)。
  2. Pivot应该选（该子序列的）最后一个元素。
  3. 递归算法，每次只能确定pivot的位置。
  4. 判断条件&&(tempLeft < tempRight)不能少。
  5. (data[tempRight].key >= tempPivot)不能写成>，否则出现两个相同key时可能出错。
  6. 冒泡算法是非常常用且基础的算法。
    java代码：
package java41to50;

import java41to50.D41_DataArray.DataNode;

public class D41_DataArray {
	class DataNode {
		int key;
		String content;

		DataNode(int paraKey, String paraContent) {
			key = paraKey;
			content = paraContent;
		}

		public String toString() {
			return "(" + key + ", " + content + ") ";
		}
	}

	DataNode[] data;
	int length;

	public static void main(String[] args) {
		System.out.println("\r\n-------顺序搜索测试-------");
		sequentialSearchTest();
		System.out.println("\r\n-------二进制搜索测试-------");
		binarySearchTest();
	}

	public D41_DataArray(int[] keyArray, String[] contentArray) {
		length = keyArray.length;
		data = new DataNode[length];
		for (int i = 0; i < length; i++) {
			data[i] = new DataNode(keyArray[i], contentArray[i]);
		}
	}

	public D41_DataArray(int[] paraKeyArray, String[] paraContentArray, int paraLength) {
		length = paraLength;
		data = new DataNode[length];
		for (int i = 0; i < length; i++) {
			data[i] = null;
		}
		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("碰撞，向前移动 " + paraKeyArray[i]);
			}
			data[tempPosition] = new DataNode(paraKeyArray[i], paraContentArray[i]);
		}
	}

	public String hashSearch(int paraKey) {
		int tempPosition = paraKey % length;
		while (data[tempPosition] != null) {
			if (data[tempPosition].key == paraKey) {
				return data[tempPosition].content;
			}
			System.out.println("Not this one for " + paraKey);
			tempPosition = (tempPosition + 1) % length;
		}
		return "null";
	}

	public static void hashSearchTest() {
		int[] tempUnsortedKeys = { 16, 33, 38, 69, 57, 95, 86 };
		String[] tempContents = { "if", "then", "else", "switch", "case", "for", "while" };
		D41_DataArray tempDataArray = new D41_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));
	}

	public String toString() {
		String resultString = "数据数组的项目个数：" + length + " .\r\n";
		for (int i = 0; i < length; i++) {
			resultString += data[i] + " ";
		}
		return resultString;
	}

	public String sequentialSearch(int key) {
		data[0].key = key;
		int i;
		for (i = length - 1; data[i].key != key; i--) {
			;
		}
		return data[i].content;
	}

	public static void sequentialSearchTest() {
		int[] unsortedKeys = { -1, 5, 3, 6, 10, 7, 1, 9 };
		String[] contents = { "null", "if", "then", "else", "switch", "case", "for", "while" };
		D41_DataArray dataArray = new D41_DataArray(unsortedKeys, contents);
		System.out.println(dataArray);
		System.out.println("Search result of 10 is: " + dataArray.sequentialSearch(10));
		System.out.println("Search result of 5 is: " + dataArray.sequentialSearch(5));
		System.out.println("Search result of 4 is: " + dataArray.sequentialSearch(4));
	}

	public String binarySearch(int key) {
		int left = 0;
		int right = length - 1;
		int middle = (left + right) / 2;

		while (left <= right) {
			middle = (left + right) / 2;
			if (data[middle].key == key) {
				return data[middle].content;
			} else if (data[middle].key <= key) {
				left = middle + 1;
			} else {
				right = middle - 1;
			}
		}
		return "null";
	}

	public static void binarySearchTest() {
		int[] sortedKeys = { 1, 3, 5, 6, 7, 9, 10 };
		String[] contents = { "if", "then", "else", "switch", "case", "for", "while" };
		D41_DataArray dataArray = new D41_DataArray(sortedKeys, contents);
		System.out.println(dataArray);
		System.out.println("Search result of 10 is: " + dataArray.binarySearch(10));
		System.out.println("Search result of 5 is: " + dataArray.binarySearch(5));
		System.out.println("Search result of 4 is: " + dataArray.binarySearch(4));
	}

	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];
			}
			data[j + 1] = tempNode;
			System.out.println("Round " + (i - 1));
			System.out.println(this);
		}
	}

	public static void insertionSortTest() {
		int[] tempUnsortedKeys = { -100, 5, 3, 6, 10, 7, 1, 9 };
		String[] tempContents = { "null", "if", "then", "else", "switch", "case", "for", "while" };
		D41_DataArray tempDataArray = new D41_DataArray(tempUnsortedKeys, tempContents);
		System.out.println(tempDataArray);
		tempDataArray.insertionSort();
		System.out.println("结果\r\n" + tempDataArray);
	}

	public void shellSort() {
		DataNode tempNode;
		int[] tempJumpArray = { 5, 3, 1 };
		int tempJump;
		int p;
		for (int i = 0; i < tempJumpArray.length; i++) {
			tempJump = tempJumpArray[i];
			for (int j = 0; j < tempJump; j++) {
				for (int k = j + tempJump; k < length; k += tempJump) {
					tempNode = data[k];
					for (p = k - tempJump; p >= 0; p -= tempJump) {
						if (data[p].key > tempNode.key) {
							data[p + tempJump] = data[p];
						} else {
							break;
						}
					}
					data[p + tempJump] = tempNode;
				}
			}
			System.out.println("Round " + i);
			System.out.println(this);
		}
	}

	public static void shellSortTest() {
		int[] tempUnsortedKeys = { 5, 3, 6, 10, 7, 1, 9, 12, 8, 4 };
		String[] tempContents = { "if", "then", "else", "switch", "case", "for", "while", "throw", "until", "do" };
		D41_DataArray tempDataArray = new D41_DataArray(tempUnsortedKeys, tempContents);
		System.out.println(tempDataArray);
		tempDataArray.shellSort();
		System.out.println("结果\r\n" + tempDataArray);
	}

	public void bubbleSort() {
		boolean tempSwapped;
		DataNode tempNode;
		for (int i = length - 1; i > 1; i--) {
			tempSwapped = false;
			for (int j = 0; j < i; j++) {
				if (data[j].key > data[j + 1].key) {
					// Swap.
					tempNode = data[j + 1];
					data[j + 1] = data[j];
					data[j] = tempNode;

					tempSwapped = true;
				}
			}
			if (!tempSwapped) {
				System.out.println("Premature");
				break;
			}
			System.out.println("第" + (length - i) + "回");
			System.out.println(this);
		}
	}

	public static void bubbleSortTest() {
		int[] tempUnsortedKeys = { 1, 3, 6, 10, 7, 5, 9 };
		String[] tempContents = { "if", "then", "else", "switch", "case", "for", "while" };
		D41_DataArray tempDataArray = new D41_DataArray(tempUnsortedKeys, tempContents);
		System.out.println(tempDataArray);
		tempDataArray.bubbleSort();
		System.out.println("结果\r\n" + tempDataArray);
	}

	public void quickSortRecursive(int paraStart, int paraEnd) {
		if (paraStart >= paraEnd) {
			return;
		}
		int tempPivot = data[paraEnd].key;
		DataNode tempNodeForSwap;
		int tempLeft = paraStart;
		int tempRight = paraEnd - 1;
		while (true) {
			while ((data[tempLeft].key < tempPivot) && (tempLeft < tempRight)) {
				tempLeft++;
			}
			while ((data[tempRight].key >= tempPivot) && (tempLeft < tempRight)) {
				tempRight--;
			}
			if (tempLeft < tempRight) {
				System.out.println(tempLeft + " 和 " + tempRight + " 交换");
				tempNodeForSwap = data[tempLeft];
				data[tempLeft] = data[tempRight];
				data[tempRight] = tempNodeForSwap;
			} else {
				break;
			}
		}
		if (data[tempLeft].key > tempPivot) {
			tempNodeForSwap = data[paraEnd];
			data[paraEnd] = data[tempLeft];
			data[tempLeft] = tempNodeForSwap;
		} else {
			tempLeft++;
		}
		System.out.print("从 " + paraStart + " 到 " + paraEnd + ": ");
		System.out.println(this);
		quickSortRecursive(paraStart, tempLeft - 1);
		quickSortRecursive(tempLeft + 1, paraEnd);
	}

	public void quickSort() {
		quickSortRecursive(0, length - 1);
	}

	public static void quickSortTest() {
		int[] tempUnsortedKeys = { 1, 3, 12, 10, 5, 7, 9 };
		String[] tempContents = { "if", "then", "else", "switch", "case", "for", "while" };
		D41_DataArray tempDataArray = new D41_DataArray(tempUnsortedKeys, tempContents);
		System.out.println(tempDataArray);
		tempDataArray.quickSort();
		System.out.println("结果\r\n" + tempDataArray);
	}
}

第46天，引用的java代码：

package java41to50;

public class D46_quickSort {
	public static void main(String[] args) {
		System.out.println("\r\n-------冒泡排序测试-------");
		D41_DataArray.quickSortTest();
	}
}

结果输出：

-------快速排序测试-------
数据数组的项目个数：7 .
(1, if)  (3, then)  (12, else)  (10, switch)  (5, case)  (7, for)  (9, while)  
2 和 5 交换
3 和 4 交换
从 0 到 6: 数据数组的项目个数：7 .
(1, if)  (3, then)  (7, for)  (5, case)  (9, while)  (12, else)  (10, switch)  
从 0 到 3: 数据数组的项目个数：7 .
(1, if)  (3, then)  (5, case)  (7, for)  (9, while)  (12, else)  (10, switch)  
从 0 到 1: 数据数组的项目个数：7 .
(1, if)  (3, then)  (5, case)  (7, for)  (9, while)  (12, else)  (10, switch)  
从 5 到 6: 数据数组的项目个数：7 .
(1, if)  (3, then)  (5, case)  (7, for)  (9, while)  (10, switch)  (12, else)  
结果
数据数组的项目个数：7 .
(1, if)  (3, then)  (5, case)  (7, for)  (9, while)  (10, switch)  (12, else)
头很凉快
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值