资源列表
LinkList_test
- 数据结构单链表基本操作，用codeblocks测试通过。初始化，头插法尾插法，清空，判空，求长度，查找元素，删除元素，插入元素等。-Basic operations of single linked list data structure, with codeblocks test. Initialization, the first interpolation tail interpolation, empty, empty sentence, seeking length, find ele
StaticLinkList
- 静态链表基本操作，用codeblocks测试通过。静态链表即用游标来代替指针的数组型链表。含初始化，插入操作，删除操作。静态链表详细内容参见小甲鱼数据结构视频14-16节内容。-Static list of basic operations, using codeblocks test. Static list that is used instead of a cursor pointer array type list. Including initialization, insertion
CycleList
- c语言编写循环链表基础操作，用codeblocks调试可行，包含初始化，求长度，找节点，约瑟夫/升级版约瑟夫（带密码），拉丁方阵，魔术师发牌问题，详细见小甲鱼数据结构视频。-c language circular list-based operation, with codeblocks debugging feasible, including initialization, seeking length, looking for nodes, Joseph/upgraded version
c
- 本次试验的主要要点是哈夫曼树的建立过程，这种算法的思路是： 1）依据给定的n个权值{W0，W1，……，Wn-1}构造n棵只有一个根结点的二叉树，这些二叉树组成一个森林F={T0，T1，……，Tn-1}。 2）在森林F中选取两棵根结点的权值最小的二叉树作为左、右子树合并成一棵新的二叉树，这棵新的二叉树的根结点的权值等于其左、右子树根结点的权值之和。这样一来，森林中就减少了一棵树。 3）重复上一步，直到森林F中只有一棵二叉树为止，这棵二叉树便是要得到的哈夫曼树 二叉树建立好之后，通过
Wood-polished-to-achieve
- 木柴抛光的实现，分析源数据存储结构，使用二次排序。借此将最小的抛光时间计算出来。-Firewood polished implementation, analysis of the source data storage structure, the use of a secondary sort. Whereby the minimum polishing time calculated.
m_files_4
- Today, there is almost no area of technical endeavor that is not impacted in some way by digital image processing.We can cover only a few of these applications in the context and space of the current discussion. However, limited as it is, the m
SpatialAnalysis
- 简单的空间查询功能，可以为初学者提供帮助。-Simple spatial query function, can provide help for beginners.
BigNum
- 非常实用的一个高精度数据结构代码，同时也定义了一些其他重要的数学运算，适合密码学使用。-Very practical one high-precision data structure of the code, but also defines a number of other important math, for the use of cryptography.
hhhhhk
- finds faces amd eyes
3dmax-and-vc-and-opengl-two
- 3dmax模型导入到用opengl库和c++实现的小场景中，有两个房子，屋顶是树叶，可以在房子内外漫游，用microsoft visiual studio 2008打开-3dmax model into the library and c++ with opengl achieve a small scene, there are two houses, roof leaves, you can roam the house and outside, with microsoft visiual
EightCode_BFS
- 用广度优先遍历实现八数码的自动求值，写出到文件，从文件读入时有小问题-Breadth-first traversal is used to implement the eight digital automatic evaluation, to write to a file, read from the file have a little problem
Constant
- A* 算法实现(有字符界面)方便初学者学习，理解算法过程-A star algorithm implementation by java