资源列表
1
- 用C++来实现 把所有猴子当做结点 建立一个循环链表 再从第一个猴子开始间隔一个数目的来选择 最后的猴子当大王 -Using C++ to achieve all the monkeys as the establishment of a cycle node list from the beginning of the first interval of a monkey to choose the number of the last king of the monkeys when
1
- 简单的学生成绩管理系统 能够完成录入查找排序等功能-A simple student achievement management system able to complete the search for order entry and other functions
unionExample
- Descr iption: This program can be used to perform elementary operations using union.
num
- 数组周边元素问题 读写文件都可以实现 求数组周边的平均值-Issues surrounding the array elements to read and write files can find the average of an array of peripheral
timestamp_p
- 显示程序运行时间的程序，非常好的子程序 调用很简单-The subroutine of time of program elasped。 It is very easy to call
fig1_16
- 合成孔径雷达sar探测距离相对于孔径功率的MATLAB仿真程序，最后结果以图表形式给出-Synthetic aperture radar sar detection distance with respect to the aperture power MATLAB simulation program, the final result is given in the form of a chart
PRIME
- 快速计算100000000以内素数个数，并快速求出某个素数的值。-Quickly calculate the number of primes less than 100 million.
pca
- 主成分分析（Principal Copmponent Analysis，简称PCA）是一种常用的机遇变量协方差矩阵对信息进行处理、压缩和提取的有效方法。主成分分析，这种方法可以有效的找出数据中最“主要”的元素和结构，去除噪音和冗余，将原有的复杂数据降维，能够发掘出隐藏在复杂数据背后的简单结构。-PCA (Principal Copmponent Analysis, abbreviated PCA) is a commonly used covariance matrix Opportunity
Kruskal
- kruskal算法，可以用来解决最小生成树的问题，本算法已经改进，可以直接输入邻接矩阵计算便可-kruskal algorithm can be used to solve the minimum spanning tree problem, the algorithm has been improved, you can directly enter the adjacency matrix can be calculated
My_Dijkstra
- 算法分析与设计技巧Dijkstra算法cpp实现-Algorithm analysis and design techniques to achieve Dijkstra algorithm cpp
main
- 对语音信号基频的提取对于语音信号的分析有一定作用-Basic frequency of speech Analysis
LED7s
- 七段LED数码管显示译码器设计，将输入的16位二进制数据分别输出到4个数码管上-Seven-segment LED display decoder design, the input of 16 binary data are output to the four digital tube