八大排序
CRUD_BOY。
这个作者很懒,什么都没留下…
展开
-
归并排序
public class MergeSort { public static void merge(int [] arr, int L, int M, int R) { int [] left = new int [M - L]; int [] right = new int [R - M + 1]; for(int i = 0, j = L; i < left.length;...原创 2020-01-26 17:58:58 · 145 阅读 · 0 评论 -
快速排序
public class QuickSort { public static void main(String[] args) { int [] arr = new int [] {3,2,5,8,4,7,6,9,1,0}; quickSort(arr,0,arr.length-1); for (int i = 0;i < arr.length;i++) { System...原创 2020-01-23 12:38:12 · 184 阅读 · 0 评论 -
堆排序
public class HeapSort { //调整堆,tree是堆数组,n是数组的"长度",i是要调整的父节点的下标 public static void heapAdjust(int [] tree, int n, int i) { if(i >= n) { return ; } int max = i; int c1 = 2*i + 1; int c2...原创 2020-01-22 14:32:41 · 120 阅读 · 0 评论 -
希尔排序
public class ShellSort {public static void main(String[] args) {int [] arr = new int [] {9, 6, 11, 3, 5, 12 , 8, 7, 10, 15, 14, 4, 1, 13, 2};int [] gap = new int [] {4,2,1};shellSort(arr,gap);for...原创 2020-01-21 15:53:47 · 158 阅读 · 0 评论 -
插入排序
public class InsertSort { public static void main(String[] args) { int []arr = {3,2,5,8,4,7,6,9,1,0}; insertSort(arr); for(int i = 0;i < arr.length;i++) { System.out.print(arr[i]+" "); ...原创 2020-01-20 14:34:56 · 165 阅读 · 0 评论 -
选择排序
public class SelectSort { public static void main(String[] args) { int [] arr= {3,2,5,4,7,6,9,1,0}; selectSort(arr); for(int i = 0;i < arr.length;i++) { System.out.print(arr[i]+" "); }...原创 2020-01-20 14:10:26 · 142 阅读 · 0 评论 -
冒泡排序
public class BubbleSort { public static void main(String[] args) { int []arr = {3,2,5,8,4,7,6,9,1,0}; bubbleSort(arr); for(int i = 0;i < arr.length;i++) { System.out.print(arr[i]+" "); ...原创 2020-01-20 14:04:44 · 147 阅读 · 0 评论