资源列表
phone
- 数据结构中线形结构的课程设计:电话簿系统的设计与实现-Linear structure of the data structures curriculum design: system design and implementation of directory
yuesefu
- 约瑟夫环的c++语言解决代码，visualc++6.0编译成功-Josephus' s c++ language with code, visualc++6.0 build success
shouyinzhushou
- 根据系统全部零钱内钱币的信息，按钱币总张数最少的原则进行退币， 零钱总数：50元的10张，20元的20张，10元的50张，5元的100张，1元的100张，5角的200张，1角的500张，一角以下的可以丢弃。-According to the information system within all change coins, the coins, the total number of at least the principle of the coin, change the total n
Maze_final0
- 改电脑鼠算法进行了改进，完整的参赛代码。-Change the computer mouse, the algorithm is improved, the entry code.
2
- 二)二叉排序树的一些基本操作 (1)利用二叉链表的存储形式，从键盘输入建立一棵二叉排序树； (2)对（1）中建立的二叉排序树进行中序遍历并打印； (3)编写算法，判断一棵二叉树是否为二叉排序树。 (4)在（1）建立的二叉排序树中，查找一个树中不存在的关键字后并插入，之后打印该树； -B) binary tree of some sort of basic operations (1) the use of binary list of the storage form of
8Q
- 8皇后问题的解算程序,DOS 系统下运行，使用MS C6.00 编译，演示一种搜索算法-example for 8-QUEEN
8
- This program identifies the best poker hand made up of 5 cards from the 7 provided. These cards are - or space separated and look like this: 3S-9D 5S-6D-TH-2S-KC. The first letter of each pair is the value which is one of 2,3,4,5,6,7,8,9,T,J,Q,K, A.
math
- 数据统计，可以计算最大值和最小值，还有平均值。可以删除最大值最小值。可以排序。-Statistics, maximum and minimum values can be calculated, as well as average. You can delete the maximum minimum. Can be sorted.
yu
- 最短路径 ----因特网最短路径优先(OSPF)路由算法的实现 ----- Internet shortest path shortest path first (OSPF) routing algorithm to achieve
duipaixu
- 用MFC实现的数据结构中的堆排序算法。程序可运行。-MFC implementation of data structures in the heap sort algorithm.The program can run.
main
- AVL树中 插入、删除节点以及判断一棵二叉查找树是否为AVL树-AVL tree, insert, delete nodes and a binary search tree to determine whether the AVL tree
chinesewordoutputPointMat
- 点阵输出汉字,根据汉字字库，在屏幕上涌一个一个的点拼出汉字-output the chinese word into points mat