摘要：
算法采用数据集为iris(鸢尾花)可以在UCI上下载 http://archive.ics.uci.edu/ml/datasets/Iris数据集介绍：1. sepal length in cm2. sepal width in cm3. petal length in cm4. petal wid... 阅读全文
摘要：
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... 阅读全文