资源列表
sealres3
- seal online no nanika 03
profiling_lab
- Type the following program that is a simple one dimensional matrix. It will initialize it with a value of 1.0; it then forms two loops to initialize it.
Dipole
- dipole的场分布分享，转载至ElectricField Dipole.nb(Field distribution sharing , transfer to ElectricField Leaf.nb)
二次解析
- 视频二次解析，自定义播放器。解析所有VIP视频。做视频网站必备(Video two resolution, custom player. Parse all VIP videos. Video site necessary to do.)
PUBG透视辅助
- PUBG perspective assist document code
最小二乘
- matlab实现数据补缺，采用的是最小二乘法和平均值填补，补缺的数据用特殊颜色标记。(Matlab realization of data deficiency, least square method)
VHDL方波
- 在Quartus II 中，利用VHDL 语言产生方波，程序如下(The VHDL language produces Fang Bo)
链栈
- 数据结构，使用c++实现的链栈，简单实现没有bug，啦啦啦(Data structure, the use of c++ chain stack, simple implementation without bug, cheerleading)
链队列
- 数据结构，使用c++实现的链队列，简单实现没有bug，啦啦啦(Data structure, the use of c++ to implement the chain queue, simple implementation without bug, cheerleading)
快速排序
- 数据结构，使用c++实现的快速排序，简单实现没有bug，啦啦啦(Data structure, the use of c++ to achieve fast sorting, simple implementation without bug, cheerleading)
冒泡
- 数据结构，使用c++实现的冒泡排序，简单实现没有bug，啦啦啦(Data structure, using c++ to implement bubble sort, simple implementation without bug, cheerleading)
背包问题
- 贪心算法解决背包问题：给定n种物品和一个背包。物品i的重量是Wi，其价值为Vi，背包的容量为C。应如何选择装入背包的物品，使得装入背包中物品的总价值最大?(The greedy algorithm solves the knapsack problem: a given n item and a backpack. The weight of the item I is Wi, its value is Vi, and the capacity of the knapsack is C. How