资源列表
sequence-list
- 初始化顺序表L；依次采插入a,b,c,d,e元素；输出顺序表L；输出顺序表L长度；判断顺序表L是否为空；输出顺序表L的第三个元素；输出元素’a’的位置；在第四元素位置上插入’f’元素；输出顺序表L； 删除顺序表L的第三个元素；输出顺序表L； -The initialization sequence table L followed by mining into the A, B, C, D, e elements the output sequence table L the ou
1050MovingTtables
- HDOJ ACM input:The input consists of T test cases. The number of test cases ) (T is given in the first line of the input. Each test case begins with a line containing an integer N , 1<=N<=200 , that represents the number of tables to move. Ea
Java 二叉树 算法
- 用Java编写的二叉树的数据结构，包括二叉树的每个节点的值，以及各子树的指针。 -Java prepared by the binary tree data structures, including binary tree each node values, and the subtree target.
FILE27
- 用C语言来实现的10维迷宫问题 来字符的作品 来自一个很用C语言来实现的10维迷宫问题 来字符的作品 来自一个很很阳光又喜欢不断不断分析问题的男孩很阳光又喜欢不断不断分析问题的男孩 在读大学-Using C language to realize the 10-dimensional maze problem to characters from the works of a very used C language to realize the 10-dimensional maze prob
8QUEEN
- 8 queens problem in c/c++
add
- 简单的通过指针实现的多项式相加的算法，方便新手对VC进行学习-Through a simple polynomial algorithm pointer implemented to facilitate the novice to learn VC
QuickSort
- 任取待排序记录序列中的某个记录(例如取第一个记录)作为基准(枢),按照该记录的关键字大小,将整个记录序列划分为左右两个子序列: 左侧子序列中所有记录的关键字都小于或等于基准记录的关键字 右侧子序列中所有记录的关键字都大于基准记录的关键字 -Take any sequence of records to be sorted in a record (for example, take the first record) as a reference (pivot), in accor
paixu
- 这是用C语言实现插入、选择、冒泡排序，对大家学习数据结构有所帮助
Dijkstra
- 单源最短路径问题：给定带权有向图G=(V,E)。给定V中的一个顶点v，称为源。要计算从源到所有其它各顶点的最短路径长度。
decisiontree
- 这个是一个关于建立决策树的python程序．本程序运用entropy来决定splitting point.处理的数据得在程序中输入．希望大家觉得有用-This is a decision tree on the establishment of procedures for the python. Entropy of the process to decide the use of splitting point. Deal with the data was input in the pro
zhan
- 队列的顺序存储结构和操作实现 队列的顺序存储结构和操作实现-The order of the queue storage structure and operation of the order of the realization of the queue storage structure and operation of the realization of
supermarketsiete
- 超市选址，用数据结构，求最小生成树问题。自设计算法为超市寻找一个最短路径。-Supermarket site, the data structure, and minimum spanning tree problem. Since the design of algorithms for the supermarket to find a shortest path.