See what you want to see

java简易优先队列（小顶堆） class Heap{ private int[] heap; private int size; public Heap(int n) { heap = new int[n + 1]; size = 0; } public void offer(int num) { int father = ((size - 1) >> 1), index = size; heap[index] = num; while (father &g

三路快排适用于待排序元素存在大量重复的情况，可以接近线性时间复杂度。 public class Test { public static void main(String[] args){ Random random = new Random(); int[] nums = new int[20]; for (int i = 0;i < nums.length;i++) { nums[i] = random.nextInt(3); } new Test().quick

public class Test { public void mergeSort(int[] nums, int low, int high) { if (low >= high) return; int mid = low + ((high - low) >> 1); mergeSort(nums, low, mid); mergeSort(nums, mid + 1, high);