快速排序(带输入)
package com.lei.sort;
import java.util.Scanner; public class quick_sort { public static void main(String[] args) { Scanner input = new Scanner(System.in); String[] ss = null; while (true) { System.out.println("输入数字,用空格隔开.输入结束请换行输入exit。"); System.out.println(); String temp = input.nextLine(); if (temp.trim().equals("exit")) { break; } ss = temp.trim().split(" "); } int q = ss.length; int[] a = new int[q]; for (int i = 0; i < q; i++) { a[i] = Integer.parseInt(ss[i]); } System.out.println("输入的数字是:"); System.out.println(Arrays.toString(a)); System.out.println(); System.out.println("输入结束"); quickSort(a, a.length); System.out.println("排序之后结果:"); System.out.println(Arrays.toString(a)); } public static void quickSort(int[] A, int n) { // write code here if (A == null || A.length < 2) { return A; } sort(A, 0, A.length - 1); } public static void sort(int a[], int left, int right) { if (left < right) { int index = find(a, left, right); sort(a, left, index - 1); sort(a, index + 1, right); } } public static int find(int a[], int left, int right) { int i = left; int j = right; int q = a[left]; while (i < j) { while (i < j && q <= a[j]) { j--; } if (i < j) { a[i++] = a[j]; } while (i < j && q >= a[i]) { i++; } if (i < j) { a[j--] = a[i]; } } a[i] = q; return i; } }
堆排序
<span style="font-size:14px;">package com.lei.sort; //不稳定 import java.util.Arrays; public class HeapSort { public static void main(String[] args) { int[] a={49,38,65,97,76,13,27,49,78,34,12,64}; int arrayLength=a.length; //循环建堆 for(int i=0;i<arrayLength-1;i++){ //建堆 buildMaxHeap(a,arrayLength-1-i); //交换堆顶和最后一个元素 swap(a,0,arrayLength-1-i); System.out.println(Arrays.toString(a)); } } //对data数组从0到lastIndex建大顶堆 public static void buildMaxHeap(int[] 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]<data[biggerIndex+1]){ //biggerIndex总是记录较大子节点的索引 biggerIndex++; } } //如果k节点的值小于其较大的子节点的值 if(data[k]<data[biggerIndex]){ //交换他们 swap(data,k,biggerIndex); //将biggerIndex赋予k,开始while循环的下一次循环,重新保证k节点的值大于其左右子节点的值 k=biggerIndex; }else{ break; } } } } //交换 private static void swap(int[] data, int i, int j) { int tmp=data[i]; data[i]=data[j]; data[j]=tmp; } }</span>
归并排序package com.lei.sort; public class MergerSort { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub int [] a = {54,35,48,36,27,12,44,44,8,14,26,17,28}; mergeSort(a, a.length); for (int i = 0; i < a.length; i++) { System.out.println(a[i]); } } public static void mergeSort(int[] A, int n) { fen(A, 0, n-1); } public static void fen(int [] a,int left,int right){ if (left>=right) { return ; } int mod = (left+right)/2; // 继续划分成 2份 fen(a, left, mod); fen(a, mod+1, right); //合并两个 sort(a, left, right); } public static void sort (int [] A ,int left,int right){ int []temp = new int [right-left+1]; int tempmid = (left+right)/2; int templeft= left; int tempright= tempmid+1; int i= 0; while (templeft<=tempmid && tempright<=right) { if (A[templeft]<A[tempright]) { temp[i++] = A[templeft++]; }else { temp[i++] = A[tempright++]; } } while (templeft<=tempmid) { temp[i++]=A[templeft++]; } while (tempright<=right) { temp[i++]=A[tempright++]; } int j=0; while (j<=temp.length-1) { A[left++]=temp[j++]; } } }
快速排序、堆排序、归并排序
最新推荐文章于 2024-02-25 16:24:46 发布