搜索资源列表
fft
- The fft.c file is C code for a function to compute the 16 point real Fast Fourier Transform using the split radix algorithm. -The fft.c file is C code for a function to compute the 16 point real Fast Fourier Transform using the split radix algorithm.
fft
- Radix-2 Fast Fourier Transform, real or complex sin/cos transform -Radix-2 Fast Fourier Transform, real or complex sin/cos transform
splfft
- 分裂基算法,已调试,用C语言实现-Split-radix algorithm, have been debug using C language. . . . . . . . . . . . .
sort
- 包括归并排序、基数排序、快速排序、谢尔排序、以及每一种排序的详细ppt实例说明和解释~! -Including merge sort, Radix Sort, Quick Sort, Shell Sort, and sort each type of detailed examples and explanations ppt ~!
sort
- 这是一段关于四种排序方法的完全源代码及其相互之间的比较,包括:Heap sort,Merge sort,Quick sort,Radix sort-This is a period of about four kinds of methods to sort the complete source code and the comparison between, including: Heap sort, Merge sort, Quick sort, Radix sort
Radix_Sort2142121302009
- the implementation of radix sort algorithm
All-kinds-of-sort
- 本代码实现了几乎所有的排序算法,如冒泡排序,选择排序,基数排序,快速排序等。-This source code implements all kinds of basic sorting algorithm, such as bubble sort,radix sort,select sort,quick sort and so on.
SPLFFT
- splfft.for(hsplfft.for) 利用分裂基算法求复序列 的DFT -splfft.for(hsplfft.for) Split-radix algorithm for the use of complex DFT sequence
design
- The verilog implementation of 8-point FFT in verilog. Radix 2 Decimation in Frequency.
Sort
- 通过Java语言实现了选择、插入、冒泡、希尔、快速、归并、堆、基数等8种排序算法-Java based selection, insertion, bubble, shell, quick, merge, heap, radix sorting algorithm
ada1
- radix ,prims ,quicksort,strassens algorithms for ada
SortProject
- 自己写的所有的内部排序算法,包括冒泡排序,插入排序,选择排序,快速排序,堆排序,shell排序,归并排序,计数排序,基数排序等-all the internal sort, including bubble, insert, select, quick, heap, shell, merge, counting, radix sort
ADSP-21062_Compl_FFT_rad-4
- 用ADSP21062实现快速FFT基4算法 压缩包内有源代码和说明-In general, a radix-4 FFT will run faster than radix-2 FFT but will take up more space and has more restrictions on the length of the FFT. Specifically, all radix-2 FFT routines will take data lengths that are
MRELFFT
- 利用分裂基算法求实序列 的DFT, 的虚部赋值为零。-Split-radix algorithm for the use of realistic sequence of DFT, the imaginary part of the assignment to zero.
huizhong
- 实现所有经典排序算法汇总 包括选择排序、冒泡排序、快速排序、插入排序、希尔排序、归并排序、基数排序、计数排序、小根堆排序共9种算法。-Summary of the realization of all the classic sorting algorithms including the selection sort, bubble sort, quick sort, insertion sort, Shell sort, merge sort, radix sort, counting
fft2
- 512点8位基2fft程序。基于 vhdl/verilog。已仿真布线通过。-512 points, eight base 2fft program. Based on vhdl/verilog. Simulation layout has been adopted.
bin
- 初始链表的内容为:3562,6381,0356,2850,9136,3715,8329,7481,写出用基数排序法对它们进行排序的过程,并编程实现。-The initial list read as follows: 3562,6381,0356,2850,9136,3715,8329,7481, write them using radix sort method to sort the process, and programming.
AlgorithmCpp
- 主要在VC6.0上用MFC完成的排序算法和搜索算法: 首先弹出一个对话框,上面有排序前和排序后的编辑框,在排序前编辑框中输入整型数组,然后选择排序的方法,点排序按钮即将排序好的数组呈现在排序后的编辑框中。 排序顺序分“升序”和“降序”,排序方法总共7种,分别是:冒泡排序,简单选择排序,直接插入排序,希尔排序,快速排序,堆排序和基数排序。这些方法都是用c++实现的。还有一个搜索的功能,分别可以“线性搜索”和“二分搜索”,线性搜索时从排序前的数组中搜索,二分搜索时从排序后的数组中搜索,且必须
0712331_queue
- radix sort using q-radix sort using queue
ArraySort
- 排序算法 一、实验目的 掌握各种排序方法的实现思想。 二、实验内容 1、创建排序类。 2、提供操作:选择排序、冒泡排序、插入排序、*基数排序、*快速排序、*归并排序。 3、*能够显示各种排序算法的中间过程-A sorting algorithm, experimental purposes to master a variety of sorting methods to realize a thought. Second, the content of an exper