资源列表
xjh3
- 扬辉三角的打印- Raises the splendor triangle the printing
yuesefu
- 本程序采用循环单链表的算法来解决约瑟夫环问题：建立一个循环单链表，按顺序查找指定结点，找到后删除，最后打印删除的编号序列。- This procedure uses circulates Shan Lianbiao algorithm to solve the Joseph link problem: Establishes to circulate Shan Lianbiao, assigns the point according to the smooth search, after
小母牛问题
- 小母牛问题- Heifer question
几个小排序
- 几个小排序- Several slightly arrange
排队
- 小孩排队问题- The child lines up the question
gcd
- 求几个数的最大公约数及最小公倍数- Asks several integers the greatest common divisors and 鏈
number
- 求1000以内的水仙花数- Strives for 1,000 within the narcissus flower several
part
- 将正整数分解为素数之积- Decomposes the positive integer product of into the prime number
MathExpr_src
- An extensible math parser
sequence
- 用多线程来排序,共有五种算法.- Arranges with the multithreading, altogether has five algorithms
DCT_32
- 快速DCT算法32位的C语言实现，乘法次数最少，可嵌入编码器及解码器使用- Fast DCT the algorithm 32 C language realization, the multiplication number of times are least, may insert the encoder and the decoding use
DCT_64
- DCT快速算法64位的C语言实现，乘法次数目前最少，可嵌入解码器使用-DCT the fast algorithm 64 C language realization, the multiplication number of times at present are least, may insert the decoding use