随笔分类 - 算法
摘要：上代码: package com.alg.exclusive; public class classify { public static void main(String[] args) { // 找出数组中其中只出现奇数次的数 int[] arr = {1, 1, 2, 2, 3, 4, 4,
阅读全文
摘要：上代码: package com.liu.pro; public class binaryWhileSearch { public static void main(String[] args) { // 测试数组 int[] arr = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
阅读全文
摘要：上代码: package com.liu.pro; import java.util.Arrays; public class heapSort { public static void main(String[] args) { int[] arr = {9, 8, 5, 6, 2, 7, 1,
阅读全文
摘要：代码实现如下: package com.liu.pro; public class binarySearch { public static void main(String[] args) { // 测试数组 int[] arr = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
阅读全文
摘要：上代码: package com.liu.pro; import java.util.Arrays; public class bucketSort { public static void main(String[] args) { // 测试数组 int[] arr = {9, 8, 5, 6,
阅读全文
摘要：上代码 package com.liu.pro; import java.util.Arrays; public class mergeSort { public static void main(String[] args) { // 测试数组 int[] arr = {9, 8, 5, 6, 2
阅读全文
摘要：上代码: package com.liu.pro; import java.util.Arrays; public class selectionSort { public static void main(String[] args) { int[] arr = {9,8,5,6,2,7,1,3,
阅读全文
摘要：上代码: package com.liu.pro; import java.util.Arrays; public class bubbleSort { public static void main(String[] args) { int[] arr = {9,8,5,6,2,7,1,3,4};
阅读全文
摘要：上代码: package com.liu.pro; import java.util.Arrays; public class shellSort { public static void main(String[] args) { int[] arr = {9,8,5,6,2,7,1,3,4};
阅读全文
摘要：上代码: package com.liu.pro; import java.util.Arrays; public class quickSort { public static void main(String[] args) { int[] arr = {9,8,5,6,2,7,1,3,4};
阅读全文
摘要：上代码: package com.liu.pro; import java.util.Arrays; public class insertionSort { public static void main(String[] args) { int[] arr = {9,8,5,6,2,7,1,3,
阅读全文
