资源列表
CMPFFT
- cmpfft.for（hcmpfft.for） 利用经典的Cooley-Tukey基2算法求复序列 的DFT -cmpfft.for (hcmpfft.for) to use the classic Cooley-Tukey radix-2 algorithm for the DFT complex sequence
CreateHuffmanTree
- 最优二叉树或哈夫曼树 在权为wl，w2，…，wn的n个叶子所构成的所有二叉树中，带权路径长度最小(即代价最小)的二叉树称为最优二叉树或哈夫曼树。-Optimal Huffman tree or trees in the right for wl, w2, ..., wn are the n-leaf binary tree consisting of all with the right to a minimum path length (that is, the minimum pri
pangjialaijiemiantu
- 关于庞加莱截面的图形绘制，可以任意改变参数和变量-On the Poincare cross-section of the graphics rendering can be arbitrarily changed the parameters and variables
FindFiels
- 简单批处理文件，处理中毒U盘文件“丢失”批文件。可方便学习和使用。-simple batch files for the cases of losing files in flash disk with virus.
1
- 二叉树的建立以及遍历环境win_tc 二叉树的建立以及遍历环境win_tc-The establishment of a binary tree and traverse the environment, and the establishment of a binary tree traversal win_tc environmental win_tc
Upload.class
- Pagination classPagination cla-Pagination classPagination class
main
- 基于扩展卡尔曼滤波单站观测距离的目标跟踪程序，可以直接运行-Extended Kalman Filter single station observation distance of target tracking program can be run directly
php-download
- PHP通过header实现文本文件下载的代码-php header download
prac16
- the above file will display the features of an input image, that is major axis, minor axis and also eccentricity of an image will be displayed.
index
- 用php语言实现telnet到交换机，输入命令获取返回值-Php language using telnet to the switch, enter the command to get the return value
b
- 原理是临近的数字两两进行比较,按照从小到大或者从大到小的顺序进行交换, 这样一趟过去后,最大或最小的数字被交换到了最后一位, 然后再从头开始进行两两比较交换,直到倒数第二位时结束-The principle is close to the figure twenty-two comparison, in ascending or descending order of exchange, so a trip to the past, the biggest or the sm
ConsoleApplication25.vcxproj
- 实现两个大数（200位）相加 因为数值较大所以无法直接用Int或是double存储-add two large numbers