资源列表
递归解决Hanoi汉诺塔
- 解决Hanoi问题
linklist
- 用于学习数据结构得初学者学习数据结构单链表，以及和实现单链表与书本上得不同之处-Study data structure for a beginner studying single-linked list data structure, as well as the implementation on a single list with the books were different
pollard
- pollard算法，用于求整数的一个因子,时间复杂度为O(n^1/4)-Pollard algorithm, used to seek an integer factor, the time complexity is O (n ^ 1/4)
boot
- 可实现二叉树的建立 手动输入 三种遍历 前序 后序 中序遍历-The establishment of a binary tree can be achieved manually, after the three pre-order traversal order of traversal
Floyd
- floyd算法，可以直接生产一定大小矩阵的txt文件-floyd algorithm, can produce a certain size of the matrix of the txt file
HeapSort
- 经典的数据结构算法实现，堆排序里的C实现，源码请下载-Classical data structure algorithms, heap sort in the C implementation, source code download
VHDL_model_16_bit_DAC_sigma_delta
- VHDL code for a sigma delta DAC 8 bit
high-and-low-fusion-seprately
- 用matlab编写的程序，将图像的高频部分和低频部分分别以不同的融合规则进行融合，结果优于一般的最大值或者加权平均的方法-Matlab programs written in the high frequency part and low frequency part of the image were different fusion rules fusion, the result is better than the maximum or weighted average method
today1.cpp.tar
- it is a code in c++ of one of the problem of contest.
reconstrucbtree
- 北京大学数据结构课后作业 由中根序列和后根序列建立二叉树-Homework Central Peking data structure root root sequence after sequence and the establishment of binary tree
KuaiPai
- 对输入数据进行排序，采用的方法是快速排序法-quick sort
Cad
- 变速箱优化设计，这是一个非常好的软件，值得一下-Gearbox optimized design