资源列表
AQueue
- 基于数组的队列的实现，可以完成队列的基本操作，如插入，删除，查找等-It is a queue template based on an array.It can insert,cancel or seartch an element of different kind.
LinkList
- 这是数据结构里关于链式列表的代码实现，有兴趣可以看下-it is about link list ,if you have interest,you kan have a look.
Linear_Search
- 本工程包含了C语言中常用的查找方法——线性查找法，该方法简单使用，是写C程序中常用的模块。-The project includes the C language commonly used search method- linear search method, which is simple to use, is to write a C program commonly used modules.
CheXiangChongPai
- 一个关于火车车厢重排的程序，运用到栈，并用c实现的程序，程序已经调试成功可以运行-A rearrangement of the train car program, applied to the stack, and use c implementation of the program, the program has run successfully debugging
LearnList
- C++队列的实现和应用，简单源码简练，可以供初学者学习-C++ queue implementation and application of a simple concise source code, you can learn for beginners
duojidiaodu
- 多机调度源码，计算机算法设计与分析课本上所没有的例子-Multi-machine scheduling source ，On the design and analysis of computer algorithms that are not textbook examples
LLE-and-improve
- LLE（局部线性嵌入）算法研究介绍的pdf，属于算法的开山之作，LLE算法基础核心。学习LLE从这篇开始。-LLE (Locally Linear Embedding) algorithm introduced in pdf, the mountains are algorithms for, LLE algorithm is based on the core. LLE learn from this start.
Graphbreadthfirsttraverse
- 数据结构编程，里面有完整报告和全部程序文件。-Programming data structure, which has a complete report and all the program files.
1215
- VISUAL C++数据结构，贝努里树的优先级序列，能查找最小值，插入删除操作。-VISUAL C++ data structure, the priority sequence of Bernoulli tree can find the minimum, insertion and deletion operations.
binary-tree
- 1) 用先序递归过程建立二叉树（存储结构：二叉链表） 输入数据按先序遍历所得序列输入，当某节点左子树或右子树为空时，输入‘*’号，如输入abc**d**e** 2) 编写递归算法，计算二叉树中叶子结点的数目。 3）按凹入表方式输出该二叉树。 -1) The process established by the first order recursive binary tree (memory structure: binary list) input data sequen
rand-program
- 一个简单的随机数生成程序，采用c++语言，在visual c++ 6.0环境执行-A simple random number generator program, using c++ language, in visual c++ 6.0 environment to perform
rengelookup_list_4
- 本人学习C语言链表时的简单使用。实现二分法的查找功能。-I learn the C language linked list is simple to use，Dichotomy of the Find feature .