随笔分类 - 算法导论实战
摘要:1 package iYou.neugle.graph; 2 3 import java.util.ArrayList; 4 import java.util.List; 5 6 //创建图过程的代码在图的那篇博文中,此处直接使用 7 public class Dijkstra ...
阅读全文
摘要:1 package iYou.neugle.graph; 2 3 import java.util.Set; 4 import java.util.TreeSet; 5 6 //创建图过程的代码在图的那篇博文中,此处直接使用 7 public class Kruskal { 8...
阅读全文
摘要:1 package iYou.neugle.graph; 2 3 import java.util.ArrayList; 4 import java.util.List; 5 6 //创建图过程的代码在图的那篇博文中,此处直接使用 7 public class Prim { 8 pri...
阅读全文
摘要:1 package iYou.neugle.graph; 2 3 import java.util.LinkedList; 4 import java.util.Queue; 5 import java.util.Stack; 6 7 public class MyGraph1 ...
阅读全文
摘要:1 package iYou.neugle.tree; 2 3 import java.util.ArrayList; 4 import java.util.List; 5 6 public class Binary_Tree { 7 private Tree tree ...
阅读全文
摘要:1 package iYou.neugle.list; 2 3 public class MySeqStack { 4 private Stack stack = new Stack(); 5 6 class Stack { 7 public int maxSi...
阅读全文
摘要:1 // 普通队列 2 package iYou.neugle.list; 3 4 public class MySeqQueue { 5 private SeqQueue queue = new SeqQueue(); 6 7 class SeqQueue { 8 ...
阅读全文
摘要:1 package iYou.neugle.list;2 3 // 链表数据结构4 public class Node {5 // 该节点的值6 public T data;7 // 该节点指向的下一个节点8 public Node next;9 } 1 packa...
阅读全文
摘要:1 package iYou.neugle.list; 2 3 public class MySeqList { 4 private int initMaxSize = 10; 5 private T[] list; 6 private int listLen = 0; ...
阅读全文
摘要:1 package iYou.neugle.search; 2 3 public class BSTree_search { 4 class BSTree { 5 public int data; 6 public BSTree left; ...
阅读全文
摘要:1 package iYou.neugle.search; 2 3 import java.util.ArrayList; 4 import java.util.List; 5 6 public class Index_search { 7 class IndexItem...
阅读全文
摘要:1 package iYou.neugle.search; 2 3 public class Hash_search { 4 private static int m = 13; 5 private static int[] hash = new int[m]; 6 pr...
阅读全文
摘要:1 package iYou.neugle.search; 2 3 public class Binary_search { 4 public static int BinarySearch(double[] array, double key) { 5 int left...
阅读全文
摘要:1 package iYou.neugle.search; 2 3 public class Sequence_search { 4 public static int SequenceSearch(double[] array, double key) { 5 for ...
阅读全文
摘要:1 package iYou.neugle.sort; 2 3 public class Shell_sort { 4 public static void ShellSort(double[] array) { 5 int n = array.length; 6 ...
阅读全文
摘要:1 package iYou.neugle.sort; 2 3 public class Heap_sort { 4 public static void HeapSort(double[] array) { 5 for (int i = (int) Math.floor...
阅读全文
摘要:1 package iYou.neugle.sort; 2 3 public class Quick_sort { 4 public static void QuickSort(double[] array, int left, int right) { 5 if (le...
阅读全文
摘要:1 package iYou.neugle.sort; 2 3 public class Select_sort { 4 public static void SelectSort(double[] array) { 5 for (int i = 0; i array[...
阅读全文
摘要:1 package iYou.neugle.sort; 2 3 public class Bubble_sort { 4 public static void BubbleSort(double[] array) { 5 for (int i = 0; i i; j--...
阅读全文
摘要:1 package iYou.neugle.sort; 2 3 public class Merge_sort { 4 5 public static void MergeSort(double[] array, int start, int end) { 6 if (...
阅读全文
浙公网安备 33010602011771号