-
Tic-tac-toe-chess
C语言实现井字棋博弈的过程，采用极大极小算法。(The C language game of tic-tac-toe chess, using the minimax algorithm.)
- 2012-05-20 23:15:48下载
- 积分：1
-
chessboard-distance
一道poj上的问题的解答，棋盘上的距离问题。即实现棋盘上从一个点移动到王，后，兵之间最短步数的解答。(A poj answers to your questions on the chessboard distance problem. That is, move from one point to the king on the board, after the shortest number of steps between the soldiers answer.)
- 2012-06-20 10:10:45下载
- 积分：1
-
BinaryTree
二叉树实现，整个包为VS工程。包含了二叉树的基本功能(Binary Tree, the entire package is VS works. Contains the basic functions of the binary tree)
- 2012-12-28 10:40:23下载
- 积分：1
-
PX
说明： 一个用VS2008编写的冒泡排序算法演示程序，数组都是随机生成的。(Bubble Sort)
- 2014-06-18 20:06:13下载
- 积分：1
-
Tetris
使用很好的数据结构，程序运行效率高，界面简洁美观。(Good data structure, high efficiency, simple and beautiful interface.)
- 2013-03-27 10:51:16下载
- 积分：1
-
bag1
使用不同的方法解决背包问题：本算法采用的是动态规划方法，比较好的解决背包问题。(Use different methods to solve knapsack problem: The algorithm is a dynamic programming approach, a better solution to knapsack problem.)
- 2011-07-16 18:40:31下载
- 积分：1
-
HuffanCoding
读取数据，统计所得到的文件中每个字母的权值，创建哈夫曼树，哈夫曼编码。哈夫曼解码，解码后内容写入到指定的文件。
读取数据里面的内容是由英文单词组成。读取文件的时候传入文件存放的路径、读取方式以及读出以后存放的数组，最终可以得到一个存放目标文件内容的数组。
将得到的数组进行字母权值的统计，统计每个字母出现的次数，次数即为每个字母的权值。
将得到的字符数组与权值数组作为创建哈夫曼树的依据，哈夫曼树根据每个字母权值的大小来创建，每个节点，包括权值、父节点、左子、右子和字母本身。
根据哈夫曼树进行编码。形成目标文件的哈夫曼编码，将此编码返回。
根据哈夫曼树得到的数组即为解码数组，解码数组作为解码的结果返回。
写入输出文件，将解码得到的数组、文件的完整路径以及文件的写方式作为参数传入，将数组写入到相应的文件中。
(Read the data, statistical documents obtained weights for each letter, create a Huffman tree, Huffman coding. Huffman decoding, the decoded contents are written to the specified file.
Read the content inside is composed of English words. When the incoming file to read the file storage path, read mode and read out after storage array that can eventually get a storage target file contents of the array.
The resulting array of letter weights statistics, statistical number of occurrences of each letter, the number is the weight of each letter.
The resulting character array with the weights array as the basis for creating Huffman tree, Huffman tree based on the size of the weights of each letter to create, for each node, including weights, parent, left child, right child, and letter itself.
According to Huffman coding. The formation of the target file Huffman coding, this code returns.
According to Huffman decoding the resulting array is an array, the decoder decodes the result is retur)
- 2020-07-02 15:40:01下载
- 积分：1
-
zz
说明： 图的相关操作：建立图，图的遍历，查找元素，删除元素等(Map-related steps: the establishment of map, graph traversal, find elements, delete elements, etc.)
- 2008-07-25 15:20:23下载
- 积分：1
-
ch555555
C数据结构常用算法程序集５，描述数据结构算法。(C data structures commonly used algorithm suite 5, describe data structure algorithms.)
- 2005-05-09 16:17:59下载
- 积分：1
-
kmp
数据结构中的用kmp算法查找关键字，供初学者参考(Data structure using kmp algorithm to find the keyword reference for beginners)
- 2011-11-16 22:16:33下载
- 积分：1
