资源列表
E_Malevich-Strikes-Back!
- Ural 1221 Malevich Strikes Back代码，简洁明了，通过搜索正方中心坐标并判定来实现- After the greatest success of Malevich s Black Square the famous artist decided to create a new masterpiece. He took a large sheet of checked paper and filled some cells with black. After tha
jisuanqi
- 计算器可视化设计的实验源码，简易计算器mfc-Calculator visual design of experiment source, simple calculator mfc
AVLTree
- 用C++实现AVL树以及一系列操作，带注释，清晰明了，思路简洁-Use c++ to build AVL tree.
SortingBinaryTree
- 用C++实现排序二叉树的建立以及排序二叉树的查找、插入、删除。带注释，简洁明了。-Use c++ to build up a sorting binary tree,and its search,insert and delete.
main
- 安全哈希算法的实现，使用的是C语言来实现的，希望对你有用-Secure hashing algorithm, using C language, and I hope to help you
match_ok
- 实现{}#中用一个或多个}代替字符串中的#，使得该字符串变为一个完美字符串-Realize {}#} instead of using one or more strings of# so that the string becomes a perfect string
binaryTree
- 用C语言实现了递归建立二叉树以及实现了二叉树的多种遍历方式-C language and the establishment of binary tree recursive achieve a variety of binary tree traversal
进程调度.rar
- 进程调度.rar
Stack-and-Queue-
- 1.熟悉堆栈这种特殊线性结构的特性； 2.熟练并掌握堆栈在连接存储结构下的基本运算； 3.熟悉队列这种特殊线性结构的特性； 4.熟练并掌握队列在循环存储结构下的基本运算。-1 familiar with the characteristics of the special linear structure of the stack 2 skilled and master the basic operation of the stack in the connectio
Knapsack-problem
- 假设有一个能装入总重量为T的背包和n 件重量分别为W1，W2,W3,...,Wn的物品。编写算法从n件物品中挑选若干件恰好装满背包，即使得Wi1+Wi2+...+Win=T.(W旁边的字符皆为角标)。要求找出满足条件的所有解。-Suppose there is a load of T of the total weight of W1, N, W2, W3, Wn. Algorithm is compiled n items selected several pieces just loade
Linear-table-operation
- 1，线性表在顺序存储结构上的建立、插入、删除运算。 2，线性表在链接存储结构上的建立、插入、删除运算。-1, the establishment, insertion and deletion of the linear table in the sequential storage structure. 2, the linear table in the link storage structure, the establishment, insertion, delete ope
Binary-Tree
- （1）实现二叉树的构造过程，并打印出二叉树 （2）对该二叉树分别用层序、前序、中序和后序四种不同的方法进行遍历； （3）将该二叉树的所有左右子树进行交换，得到新的二叉树，并打印出该二叉树； （4）对新获得的二叉树分别用层序、前序、中序和后序四种不同的方法进行遍历。-(1) the construction process to achieve the two fork tree, and print out the two fork tree