
算法
介绍一些常见实用性基础算法
步道师就是我
10年大龄码农
展开
-
算法学习-day01
1:给你一串数字,比如1234567890,变成1,234,567,890(字符串形式) import java.util.Stack; public class Answer { public static void main(String[] args) { String a = "112348554"; Stack stck = new Stack(); for (int i = a.length()-1; i>=0; ...原创 2021-12-24 16:37:37 · 365 阅读 · 0 评论 -
05-选择排序
public class _05_QuickSort { public static void main(String[] args) { int[] arr = new int[] {22,23,6,30,7,10,11,24}; quickSort(arr,0,arr.length-1); // sort(arr,0,arr.length-1); System.out.println(Arrays.toString(arr)); ...原创 2021-11-18 10:43:49 · 321 阅读 · 0 评论 -
04-希尔排序
public class _04_ShellSort { public static void main(String[] args) { int[] arr = new int[] {5,3,11,22,-3,-1,0,-22,2,9,7,4}; for (int i = 0; i < 1000; i++) { arr = new int[1000]; int value = new Random().next...原创 2021-11-18 10:43:19 · 205 阅读 · 0 评论 -
03-插入排序
public class _03_InsertSort { public static void main(String[] args) { int[] arr = {5,3,2,9,7,6,4}; sort(arr); } private static void sort(int[] arr) { for (int i = 1; i < arr.length; i++) { int ...原创 2021-11-18 10:42:15 · 322 阅读 · 0 评论 -
02-选择排序
public class _02_SelectSort { public static void main(String[] args) { int[] arr = {5,3,2,9,7,6,1}; sort2(arr); } //方法1 private static void sort1(int[] arr) { for (int i = 0; i < arr.length-1; i++) { ...原创 2021-11-18 10:41:37 · 70 阅读 · 0 评论 -
01-冒泡排序
public class _01_MPSort { public static void main(String[] args) { int[] arr = {5,3,2,9,7,6,4}; sort(arr); System.out.println(Arrays.toString(arr)); } public static void sort(int[] arr) { for (int i = ...原创 2021-11-18 10:40:11 · 74 阅读 · 0 评论