快速排序 堆排序 java

快速排序： 

package dudongdong;

import java.util.Arrays;

public class QuickSort {
	public static void main(String[] arges) {
		QuickSort qs=new QuickSort();
		Integer[] arr={15,12,19,4,5,4,9,14};
		Integer n = arr.length;
		qs.quickSort(arr,0,n-1);
	}
	public void quickSort(Integer[] arr,int l,int r) {
		int i=l;
		int j=r;
		int key = arr[l];
		System.out.println("===========");
		while(i<j) {
			System.out.println("i="+i+" j="+j+" key="+key);
			while(i<j && arr[j]>=key) {
				System.out.println(arr[j]);
				j--;
			}
			
			while(i<j && arr[i]<=key) {
				System.out.println(arr[i]);
				i++;
			}
			
			System.out.println("停止寻找：arr[i]="+arr[i]+" arr[j]="+arr[j]
					+" 整个数组："+Arrays.toString(arr));
			int tmp = arr[i];
			arr[i] = arr[j];
			arr[j] = tmp;
			System.out.println("交换之后：arr[i]="+arr[i]+" arr[j]="+arr[j]
					+" 整个数组："+Arrays.toString(arr));
		}
		int tmp=arr[i];
		arr[i]=key;
		arr[l]=tmp;
		
		if (l<i-1) {
			System.out.println("向左递归："+Arrays.toString(Arrays.copyOfRange(arr, l, i-1)));
			System.out.println("l="+l+" i-1="+(i-1));
			quickSort(arr, l, i-1);
		}
		if(i+1<r) {
			System.out.println("\n向右递归："+Arrays.toString(Arrays.copyOfRange(arr, i+1, r)));
			System.out.println("l="+l+" i-1="+(i-1));
			quickSort(arr, i+1, r);
		}
	}
}

 堆排序： (需要注意的是如果在根节点和叶子节点对比之后未发生位置转换是不需要继续递归的，否则进入死循环。)

package dudongdong;

import java.util.Arrays;

public class HeapSort_test {
	public static void main(String[] args) {
		HeapSort_test hs=new HeapSort_test();
//		Integer[] arr={15,12,19,4,5,4,9,14};
		Integer[] arr={2,3,4,5,1};
		Integer n = arr.length;
		for(int i=n/2-1;i>=0;i--) {
			System.out.println("遍历至："+arr[i]);
			hs.heapify(arr,n,i);
		}
		for (int i =n-1;i>=0;i--) {
			System.out.println(arr[0]);
			int tmp = arr[0];
			arr[0] = arr[i];
			hs.heapify(arr, n, 0);
			arr[i] = tmp;
			n--;
		}
		System.out.println(Arrays.toString(arr));
	}
	
	public void heapify(Integer[] heap ,int n,int i) {
		if (i>n/2-1) {
			System.out.println("没有孩子 返回");
			return;
		}
		int l = 2*i+1;
		int r = 2*i+2;
		int max = i;
		System.out.println("根:"+heap[max]+" 左孩子："+heap[l]+" 右孩子："+heap[r]);
		if(l<n && heap[l]>heap[max]) {
			max = l;
		}
		if(r<n && heap[r]>heap[max]) {
			max = r;
		}
		if (max != i) {
			int tmp = heap[max];
			heap[max]=heap[i];
			heap[i]=tmp;
			System.out.println(Arrays.toString(heap)+" max下标:"+max);
			heapify(heap, n,max);
		}
	}
}