资源列表
mmx
- 经MMX, SSE 2优化后的MEMCPY,比VC中的MEMCPY快不少-as MMX, SSE, SSE2 optimization of MEMCPY than the VC lot faster MEMCPY
agenda
- 实现运动员日程安排,可以通过一个二维的矩阵在显示安排除-athletes to achieve the agenda, through a two-dimensional matrix display arrangement
稀疏矩阵运算器加减乘
- 以十字链表表示稀疏矩阵,实现两个矩阵的相加,相减,和相乘的运算.-List said with a crossbow sparse matrix, the matrix to achieve two together, subtraction, multiplication and arithmetic.
集合的交并差运算
- 演示执行集合的并,交,差运算,是以有序链表表示集合.判定子集,求补运算也实现了.-demonstration and implementation of the pool, intersection, difference, computation, is set in an orderly Chain said. Convicted subset, seeking fill operation has been achieved.
重言式
- 用二叉树实现逻辑表达式的基本运算,包括逻辑与,或,非,还可以判别表达式是重言式,还是矛盾式.-binary tree using logical expressions of basic operations, including logic and, or, not, we can judge expression is tautology, or contradiction.
平衡二叉树操作的演示
- 平衡二叉树实现一个动态查找表,有三种基本功能:查找,插入删除,还有选项功能:合并两棵平衡二叉树,和分裂两棵平衡二叉树.-balanced binary tree to achieve a dynamic lookup table, there are three basic functions : to find, delete, insert, functional options : merging two balanced binary tree, and split two balanc
大数的阶层
- 用数组存储一个大数的阶层。输入一个整数n,先求出n!占用的位数。动态开辟bits位数组，用适当方法把n!的值存储到数组里去-storage arrays with a majority of the class. The importation of an integer n, first obtained n! The median occupancy. The median opening bits dynamic group, the use of appropriate means, n
sqrty
- 此为经典排序算法.采用面向对象的思想，很有接见价值-this classical algorithm. Using object-oriented thinking, value is received
H 树
- 本程序是数据结构的一个作业题目，比较简单。但是有一两我认为还可以的创新点。当然是对初学者来说的。-this procedure is a data structure of the operations subject, relatively simple. But one or two I think I can point to the innovations. Of course, the newcomer.
二叉树程序
- 本程序实现了二叉排序树的建立以及查找,插入和删除的功能.-realized by the two forks of trees to establish order and search, insert and delete functions.
paixu
- 各种排序算法，ＳＨＥＬＬ ＭＥＲＧＥ，还有随机数的生成 -various sequencing algorithms, SHELL Merg, Random Number Generation
归并分类与快速分类平均时间之比较的源代码
- 在对本程序的快速排序和归并排序这两种算法的正确与否进行验证时，用手动输入的数据，本程序基本上完成了对输入数据进行的快速排序和归并排序!-in the process of the rapid sequencing and merging the two sorting algorithms are correct for the test, with the manual input of data, the procedure is basically completed the data e