资源列表
Josephus
- Josephus问题：一群小孩围成一圈，任意假定一个数m，从第一个小孩起，顺时针方向数，每数到第m个小孩是，该小孩便离开。小孩不断离开，圈子不断缩小。最后，剩下的一个小孩便是胜利者。究竟胜利的是第几个小孩呢？ 提示：用循环链表解答，编写程序link.h实现循环的链表类，由插入与删除等基本操作。 -Josephus problem: a group of kids form a circle, any assumption that a number of m, starting from
StudentDAO
- ，学生管理系统，可以实现增删查改，直接运行就可以了-, Student management system that can achieve the additions and deletions to search, you can directly run
student1
- 编写颁奖程序：在N个选手中评出一等奖1名，二等奖2名，三等奖3名，输出得奖的情况。 评分过程为：M个裁判给选手打分，却掉一个最高分和一个最低分后，其他分数的平均分即为选手的得分。根据选手得分来评奖。-Procedures for the preparation of presentation: In the N个players selected a first prize, second prize two, third three, the output of the situation
dileizhan
- 小游戏，很好玩，大家可以在疲劳的时候拿来放松心情，而且可以开发锻炼智力-good
glcm
- 基于灰度共生矩阵的图像特征提取,包括熵、相关性、标准差及方差-Image feature extraction based on GLCM，including entropy, correlation, standard deviation and variance
test3
- 令n＝2的m次方，A是一个2n维的数组，待求最大值的数存放在A(n),A(n＋1)，……A(2n-1)中，所求得的最大值置于A(1),于是算法描述如下： 输入：n＝2的m次方个数存在数组A(n；2n－1)中； 输出：最大数置于A(1)中。 -So that n = m th power of 2, A is a 2n-dimensional array, to be seeking the maximum number stored in A (n), A (n+
cal_gradient.tar
- This code is designed to calculate the moho depth by calculate the gradient of the vertical gradient of the vertical velocity.
LU
- 通过matlab实现的矩阵LU分解，PLU程序相比于LU程序，有所改进-Matrix LU decomposition realized by matlab, PLU program compared to the LU program, improvements
19
- 控制系统P，PI，PID控制极点配置等程序控制器稳态矫正- Control system P, PI, PID control pole assignment procedure
Segmentation-3G
- Segmentation block 3G
netkeeper-source
- 闪讯netkeeper源码C语言，懂的自行下载。只做交流用，不承担任何责任。- 闪讯netkeeper源码C语言，懂的自行下载。只做交流用，不承担任何责任。 Flash netkeeper source C language, to understand the self download. Only to do the exchange, not to assume any responsibility.
ECEFtoWGS84
- 一个关于地球坐标和直角坐标之间转换的WGS84，MATLAB程序-A about earth coordinates and rectangular coordinates transformation between WGS84, MATLAB program