资源列表
递归解决Hanoi汉诺塔
- 解决Hanoi问题
linklist
- 用于学习数据结构得初学者学习数据结构单链表，以及和实现单链表与书本上得不同之处-Study data structure for a beginner studying single-linked list data structure, as well as the implementation on a single list with the books were different
Minimum-spanning-tree
- Kruskal算法和Prim算法 任何只由G的边构成,并包含G的所有顶点的树称为G的生成树(G连通). 加权无向图G的生成树的代价是该生成树的所有边的代码(权)的和. 最小代价生成树是其所有生成树中代价最小的生成树.-Kruskal algorithm and Prim algorithm Any edge of only by G, is composed of all the vertices containing G tree called G of the spannin
shortest_path
- 最短路径演算法 (Dijkstra)，可以直接在电脑执行。-The shortest path algorithm (Dijkstra), can be directly in the computer to perform.
1
- 数据结构约瑟夫环的实现1． 本演示程序中，人数n应为任意的，首先应输入一个值赋给初始报数上限m，程序应能自动保存出列人的序号和将出列的人所持的密码赋给m，再次作为报数上限，如此循环，直至所有人都出列为止。-Implementation of data structures Joseph Central 1. The demonstration program, the number n should be arbitrary, at first, enter a value assigned t
111
- 实现数组的自动排序，以及2个一维数组的合并。合并后的新数组也实现自动排序 -To achieve an array of automatic sorting, as well as two one-dimensional array of the merger. After the merger is also automatically sort the new array
hauff
- 完整的哈夫曼编码，是用数据结构写成的，在此上传，供大家共享-Full Huffman coding, is written in the data structure, in this upload for all to share. .
fwen
- 1）手工输入几个学生信息，并将结果存入文件f1中 2）找出f1中学生分数最高的那个人，（有可能多个并列第一），将这个人的信息写入文件f2.-1) The manual input of several student information, and will result in the file f1, 2) to identify students with the highest score f1 person, (there may be more tied for first),
Algorithm-design-n-problem
- 本源码是算法设计中的N后问题，他通过C++编写。-This source is N after the algorithm design, written by C++.
tree-similar
- 按先序遍历序列建立两个二叉树的二叉链表 A 和链表 B ，设计算法判断 A 、 B 二叉树是否相似。-Traversal sequence established by the first two binary tree binary list A and list B, the design algorithm to determine A, B binary tree is similar.
Max-Points-on-a-Line
- 给定的n个点在二维平面上,发现的最大数量点躺在同一直线。-Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.
kuaisu
- 快速算法排序：用户输入10个数，然后程序自动根据快速算法进行排序-A fast algorithm for sorting