资源列表
beam_weight
- 加权的波束形成程序，均匀线列阵，可以扩展到各种阵形，各种加权情况-weighted beamforming procedures, uniform linear array, can be extended to the various camps, all kinds of weighted
gauss
- 数值分析高斯——列主元消去法主程序 说明如下： ％ a----input,matrix of coefficient ％ b----input,right vector ％ sol----output,returns the solution of linear equation-Gauss numerical analysis- out PCA elimination main program as follows: a---- input, matrix of coeffi
FIR
- FFT和FIR 快速傅里叶变换和FIR滤波器实验程序-Fast Fourier Transform FFT and FIR and FIR filter experimental procedure
dijkstra
- 实现的是所有边权为正的最短路径算法的Dijkstra和优先队列Dijstra堆算法-The right of all sides to achieve a positive Dijkstra shortest path algorithm and the priority queue heap algorithm Dijstra
C.
- 判断101-200之间有多少个素数，并输出所有素数。 1.程序分析：判断素数的方法：用一个数分别去除2到sqrt(这个数)，如果能被整除， 则表明此数不是素数，反之是素数。 -Between 101-200 to determine the number of primes, and prints out all prime numbers. 1 program analysis: methods to determine the prime numbers: a numb
prime
- 图论的最小生成树问题——Prime算法的C语言实现-Graph theory, minimum spanning tree problem- Prime algorithm in C language
kruskal
- 计算最小生成树的kruskal算法，最普通未加任何优化的最小生成树算法！利于新手理解-Algorithm for computing minimum spanning tree kruskal, the most common Without any optimization of the minimum spanning tree algorithm! Help novice to understand
KM
- KM 算法说明。如题。测试一下。 KM 算法说明。如题。测试一下。-KM algorithm
mscohere(x-y-w-noverlap-nfft-fs)
- 自己开发的小程序，可以实现快速调用文件求解相干函数。-Develop their own program, you can achieve quick access to documents for solving the coherence function.
remove_inrange_nodes_bst
- Change Color of matrixC hange Color of matrixC hange Color of matrix-Change Color of matrixChange Color of matrixChange Color of matrixChange Color of matrixChange Color of matrix
1111
- 解决小孩搬砖问题，男搬5块，女搬砖3块，三个小孩抬一块-Solve the problem of child moving bricks, moving five men, three women moving bricks, three children carry a
q9
- 贪婪算法 经典背包问题 matlab源代码 自附数值 -Greedy algorithm is the classical knapsack problem matlab source code the attached value