资源列表
xuejigunali
- 学生管理系统，能够实现对学生的成绩进行排序，并且能够增添，修改，删除学生信息-Student management system, can realize in sorting, student performance and the ability to add, modify, delete student information
mataqipan
- 给定马的初始位置然后马需要在棋盘上探索出一条途径能够踏遍棋盘，并且无重复-Given horses of the initial position and then need to explore a way to beat in the board, board and no repeat
SortingComparisons
- 基于MFC平台，界面化显示各排序的性能对比，对于学习排序的初学者有很大帮助。-Based on the MFC platform, the interface shows the sort of performance comparison, for learning to sort the beginners are of great help.
MultifunctionalCalculator
- 基于MFC平台，实现多功能计算器，可求解复杂表达式，主要实现为数据结构中链表和数组，对于要熟悉链表和数组的初学者有很帮助。-Based on the MFC platform, to achieve multi-function calculator, can solve complex expressions, the main realization of the data structure for the list and array, to be familiar with the l
ShowMapTheShortestRoute
- 根据一副地图，在地图上任意点击两地点，可画出两点的最短距离路线。对要熟悉MFC用法及最短路算法的初学者有很大帮助。-According to a map, click on the map on the two locations, you can draw two points of the shortest distance route. To be familiar with MFC usage and the shortest path algorithm for beginners a
HuffmanCodingAndDecoding
- 对任意输入的文字、字母、数字进行编码，显示出0-1串，并显示出编码表；同时可进行解码显示出原文。对要熟悉哈夫曼原理的有作用。-Any input text, letters, numbers encoded to show a 0-1 string, and display the code table at the same time can be decoded to show the original. To be familiar with the Huffman principle.
data-structure-
- 数据结构与算法分析：C语言实现，包括了书本，课后习题的答案和代码。使学习本书更加方便。-Data structure and algorithm analysis: C language implementation, including books, after-school exercise answers and code. To make learning more convenient.
code3
- Package consists of 3 files. First, to compare two linked list. Second, to find the reverse of a linked list using recursion. Third , to merge two sorted linked list
code2
- Package consists of 3 codes. First,to Print huffman decoding tree given.Second, to find top level view of a tree. Third, A reviewer rates the two challenges, awarding pointsfor three categories.We define the rating for two person s challenge to be th
8puzzle_dfs
- 实现了八数码问题，运用了图搜索中的DFS（深度优先搜索）。-翻译 实现了八数码问题，运用了图搜索中的DFS（深度优先搜索）。 The implementation of the eight digital issues, the use of the map search DFS (depth-first search).
bign
- 计算大整数的头文件，支持加减乘除，流，次方，开方，求余，小于，大于，不等于等运算。-Calculation of large integer header files to support the addition and subtraction multiplication and division, flow, power, square root, seeking more than, less than, greater than, not equal to other operatio
Huffmancode
- 着先通过 HuffmanTree() 函数构造哈夫曼树，然后在主函数 main()中自底向上开始(也就是从数组序号为零的结点开始)向上层层判断，若在父结点左侧，则置码为 0,若在右侧,则置码为 1。最后输出生成的编码-The first HuffmanTree () function to construct Huffman tree, and then main () main () the bottom up (that is, the array number zero node) t