coder_my_lover的博客

public class SelectSort { public static int[] srot(int[] targe) { for (int i = 0; i < targe.length; i++) { int min = i; for (int j = i; j < targe.length; j++) { if (targe[j] < targe[min]) { ...

public class InsertSort { public static int[] insert(int[] targe) { for (int i = 0; i < targe.length; i++) { int temp = targe[i]; while (i > 0 && targe[i - 1] > temp) { targe[i] = targ...

import java.util.Arrays; public class MergeSort { public static void main(String[] args) { int[] arr = { 9, 8, 7, 6, 5, 4, 3, 2, 1 }; sort(arr); System.out.println(Array...

public class QuickSort { public static int[] sort(int[] targe, int low, int high) { if (low >= high) return targe; // 递归出口 int l = low;// 本次排序的起始点位置 int h = ...

public class BubbleSrot { public static int[] sort(int[] targe) { boolean flag = true; for (int i = targe.length - 1; i > 0 && flag; i--) {// 外层循环表示本次内层循环要确定的最大或最小数的位置 ...