摘要：
package thread; public class ResortDemo { static int i = 0; static boolean f = false; public static void main(String[] args) { new Thread(() -> { try 阅读全文
posted @ 2022-05-07 13:33
upupup-999
阅读(80)
评论(0)
推荐(0)
摘要：
package com.wang.principle; public class Test2 { public static void main(String[] args) { int[] arr = {49, 38, 65, 97, 76, 13, 27, 50}; //int[] c = { 阅读全文
posted @ 2022-05-04 13:10
upupup-999
阅读(76)
评论(0)
推荐(0)
摘要：
public static int Partition(int[] nums,int left,int right){ int prvot=nums[left]; while (left<right) { while (left<right&&nums[right]>=nums[left])righ 阅读全文
posted @ 2022-05-04 13:07
upupup-999
阅读(43)
评论(0)
推荐(0)
摘要：
public static void main(String[] args) { int[] arr = {49, 38, 65, 97, 76, 13, 27, 50}; //int[] c = { 13, 38, 65, 97, 76, 13, 2, 50 };//稳定性判断 rec(arr,0 阅读全文
posted @ 2022-05-04 13:03
upupup-999
阅读(42)
评论(0)
推荐(0)
摘要：
/** * 插入排序 */ public static void insertSort(int[] arr) { int length = arr.length; for (int i = 1; i < length; i++) {//从第2个数字开始 for (int j = i - 1; j > 阅读全文
posted @ 2022-05-04 12:58
upupup-999
阅读(27)
评论(0)
推荐(0)
摘要：
https://zhuanlan.zhihu.com/p/488355404 阅读全文
posted @ 2022-05-04 12:32
upupup-999
阅读(28)
评论(0)
推荐(0)
摘要：
/** * 冒泡排序 */ public static void bubbleSort(int[] arr) { int length = arr.length; for (int i = 1; i < length; i++) {//比较趟数为数据量-1 for (int j = 0; j < l 阅读全文
posted @ 2022-05-04 12:15
upupup-999
阅读(35)
评论(0)
推荐(0)
摘要：
package com.wang.principle; public class Tets1 { /** * 选择排序 */ public static void selectionSort(int[] a) { int length=a.length; for(int i=0;i<length;i 阅读全文
posted @ 2022-05-04 11:50
upupup-999
阅读(59)
评论(0)
推荐(0)
摘要：
阅读全文
posted @ 2022-05-04 11:12
upupup-999
阅读(21)
评论(0)
推荐(0)
浙公网安备 33010602011771号