资源列表
SplitADT
- 链表L，创建公有成员函数Split（A,B ），创建2个新表A,B，使的A 中含有L中奇数位置元数，B中含L偶数位置元数 -Chain L, create public member function Split (A, B), to create two new tables A, B, A so containing L odd position of a few yuan, B-L even a few locations yuan
ssdff
- 可重用的向量 矩阵类代码.rar(29.75K)?芍赜玫南蛄?矩阵类代码.rar(29.75K)可重用的向量 矩阵类代码.rar(29.75K)-reusable vector matrix category code. Rar (29.75K) reusable vector matrix category code. R ar (29.75K) reusable vector matrix category code. rar (29.75K) reusable vector Moment
MERGE-SingleADT1
- 用单链表实现对两个无序 A,B表进行合并并使的合并后的表按从小到大排序
jhgrerfgjz
- 一个简单的求矩阵求逆的c语言算法 一个简单的求矩阵求逆的c语言算法 一个简单的求矩阵求逆的c语言算法-a simple matrix inversion for the C language algorithms for a simple matrix inversion of the c language a simple algorithm The matrix inversion for the C language algorithms for a simple matrix
REVERSE1
- 设表的Reverse运算将表中次序反转，实现单链表的Reverse，为公有成员-based questionnaire Reverse Operators will reverse the table order to achieve single-Chain Reverse. members of the public
YUESEFU2
- 用双链表实现的踢人问题，一群人按顺序排成一圈，从第一个人开始每隔M人踢出一个人，如此循环，求已知最后n个被踢出的，求M-used to achieve the double chain gangs, a group of people formed a circle on the order, started from the first one out of every M-1, so the cycle, known for the last n throwaway, for M
tsinghuadatastructureallcode(CLanguage)2
- 清华 严蔚敏《数据结构》的全部代码实现C语言 -Qinghua Yan Wei Min "data structure" to achieve the full C language code
CRC16_C
- 在C语言中开发的crc16查表算法的源代码，看看有没有参考价值！-in C language development crc16 Lookups for the source code, to see if there is any reference value!
RegPay
- Print a string backwards.rar Print a string backwards.rar-Print a string backwards.rarPrint a strin g backwards.rarPrint a string backwards.rar
QueenShow
- 八皇后演示程序,VC6.0开发环境 初学c++ 望指正-eight Queen's Demonstration Program, VC6.0 development environment novice c hope correction
Hugeint
- 巨型整形实现,长度不受windows机器字长限制,实现了基本的加减乘除等运行.-giant plastic realization length from windows machine word limit, realize the basic arithmetic and other operations.
Mid_Pre_Post
- 由二叉树的中序访问序列和后序访问序列，得到二叉树的前序访问序列。-binary tree from the visit to the Middle sequence after sequence and the sequence visit, the first to be binary tree sequence visit sequences.