搜索资源列表
Binary serach
- binary search test it
新建文件夹
- 包含了线性表、栈、队列、二叉树、查找排序等多个内容，还实现了约瑟夫斯问题。(It includes many contents such as linear table, stack, queue, two fork tree, search sort and so on. The Josephus problem is also realized.)
U201514766
- 基于查找表的单词检索软件，设计与实现静态查找表、基于二叉排序树的动态查找表及HASH表等三种中的任意两种查找表结构及其抽象数据类型；以一本英文电子书（如英文小说，科普读物或圣经之类的社会书籍，书的篇幅不少于2万次单词）作为单词文本数据来源，使用上述查找表ADT，通过读取电子书而建立对应的两种查找表，以单词作为关键字，单词在书籍中出现的次数及每次出现的页码，行号等信息作为查找表数据元素属性；通过理论与实际测试结果对比分析两种查找表性能。(The design and implementation
huffman
- 对给定字符建立哈夫曼树并解码和编码，手动输入权值和数量(Set up the Hoffman tree for a given character and decode and encode)
数据结构
- 学习数据结构一个比较基础的代码，实现遍历二叉树，插入合并操作。(Learn a relatively basic code of the data structure to traverse the two forked tree and insert the merge operation.)
邻域计算
- kd树数据存储结构，进行klinyu搜索，GUI界面，具有保存搜索的k邻域数据(Kd tree data storage structure, k linyu search, GUI interface, with k neighborhood data to save the search)
tree3
- 集成了二叉树的基本需求，内含二叉树的循环链表实现的非递归层次遍历和运用链表求树的宽度。(It integrates the basic requirement of two branch tree, which includes the recursive link list implemented by two binary tree, and the width of tree is calculated by linked list.)
决策树+神经网络
- 人工智能AI，决策树和神经网络的原理说明(MEMORY-EFFICIENT GLOBAL REFINEMENT OF DECISION-TREE ENSEMBLES AND ITS APPLICATION TO FACE ALIGNMENT)
Iris-Dataset-Analysis-master
- 用决策树-回归分析模型来分析鸢尾花数据，训练后最终可以得到模型的准确率(Using decision tree-regression analysis model to analyze iris data, the accuracy of the model can be obtained after training.)