搜索资源列表
ch01-03
- 本程序用于在指定目录下增加一个新目录，快捷，灵活，方便。-the procedures used in designated directories, add a new directory, fast, flexible and convenient.
1e2w3
- 很好的一个软件包，快下哉呀 很好的一个软件包，快下哉呀 -a good package, fast ..... ah under a good package, fast under zai ah
FFTbaseTime2
- 快速傅立叶变换的编码，基二的按时间抽取方法实现，包含完整的源代码和测试程序，在里面重载了许多符号-fast Fourier transform coding, the two-time extraction method. includes complete source code and testing procedures, which in many symbols Heavy
Visual-CPP-Note
- 零基础学Visual C++的课件，可以帮助读者快速提高Visual C++编程能力-Zero-based Visual C++ courseware, fast to improve Visual C++ programming ability can help readers
SortComparor
- 比较插入、归并、快速、基数四种排序算法的性能-Comparison of insertion, merge, fast, and base the performance of four sorting algorithms
huffman
- very fast huffman code
FFT_kris32
- This source code is the 32point FFT(Fast Fourier Transform) for Real Time sampling system (like PQ meter or Digital Relay). The complex computation is realized without complex.h in this code, based on only C. -This source code is the 32point FFT(Fast
c++
- Fast prime calculator
test1
- list对任意位置的元素进行插入，删除，查找都是极快速的，list的每个节点都有三个域：前驱元素指针域，数据域，后驱元素指针域-List any position of the elements to insert, and delete, find it is extremely fast, the list each node has three domain: precursor element pointer domain, data fields, the rear element p
sort
- 常见排序算法的算法实现，插入，快速，选择，冒泡-Algorithm of the common sorting algorithms, insertion, fast, select, bubbling
FFT
- 快速fft算法的实现，增加了从文件读入的功能-Fast fft algorithm, increase the ability to read from the file into the
fft
- fft测试代码，用于测试快速傅立叶变换的代码-fft test code, test, Fast Fourier Transform
compute_lasfousnum
- 采用分治法快速求解拉斯斐切数。代码用C语言编程实现，可用于处理数学问题。-The divide-and-conquer method fast solving Lasifeiqie number. Code with C language programming, can be used to deal with mathematical problems.
MergeSortL_AND-QuickSort
- MergeSortL_AND QuickSort，计算机算法设计与分析中的链表的归并排序算法和快速排序算法-MergeSortL_AND QuickSort, linked list merge sort algorithm in the design and analysis of computer algorithms, and fast sorting algorithm
sort
- 常见排序算法的实现性能比较，包括快排，归并、选择、插入、冒泡和堆排序-The realization of the common sorting algorithm performance, including fast row, merge, select, insert, bubbling and heap sort
QuickSort
- 快排，这个是我认为写得最好的快排代码了。快速排序可以在log2(n)的时间内对数组元素进行排序。-Fast row, this is my opinion, the best written fast row code. Quicksort log2 (n) time to sort the array elements.
pardiso_unsym_c
- 利用Intel mkl求解线性方程组的例子，其中调用了pardiso函数，特别适合快速求解稀疏线性方程组-Intel MKL for solving linear equations with examples, which calls pardiso function, particularly suitable for fast sparse linear equations
dit-fft.c
- 快速傅里叶变换（FFT）。允许输入任意长度（满足等于2的N次幂即可）。-Implementation of the Fast Fourier Transformer.
n_queen_QS4
- 利用QS4算法解决N皇后问题，解决300万的皇后所需时间在5s左右，特别快-Use QS4 algorithm to solve the N-queens problem, solve 3000000 Queen the time required for about 5s, particularly fast
N_queen_QS2
- 利用QS2算法解决N皇后问题，解决50万的皇后所需时间在5s左右，特别快-QS2 algorithm to solve the N-queens problem, solve 500000 Queen the time required for about 5s, particularly fast