资源列表
1
- 查找多数元素majority，最快实现的算法代码。-majority
Roman_numeral_conversion
- 简单的罗马数字转换程序，将罗马数字转换成阿拉伯数字，c++实现-Roman numerals simple conversion process, c++ to achieve
birthday
- 这段代码是在vc++环境下编一的一个简单的用来计算出生时间是周几的代码.-This code is in vc++ environment, compile a simple one used to calculate the time of birth is the code for a few weeks.
Bag_0_1
- The 0-1 knapsack problems
vbs
- 电脑限时开机，电脑定时关机。不到制定的时间段无法开机，晚上到了指定时间会自动关机。-Computer starting up time, computer shutdown timer. Not to make time to boot, at the appointed time will automatically shut down.
circle
- 以适合于matlab初学者的程序，简单易懂，鼓励更多地大侠共享更多地源程序-Suitable for beginners with matlab program, easy to understand and encourage more master sharing more ground source program
Read_EH4_FileY_By_Matlab
- EH4 Y 文件读取，用MATLAB编写-EH4 Y file read using MATLAB
gaosixiaoqu
- 计算方法：主要是高斯消去法的C语言算法实现-Calculation method: Gaussian elimination
frekvencija-metar
- Program AVR za mjerač protoka-Program AVR za mjerač protoka
ledflow
- 流水灯，最好的设计资料，适合20岁以下成年人-led flow
BIAOCHARUFA
- 排序，定义结点类型，单链表排序排序，定义结点类型，单链表排序-Sequenceclass node{public: int data node* next node () {next=NULL }
hannuota
- 1. 跟汉诺塔相关问题：如果有n个盘子，总共需要移动多少次？教士们传说当64个盘子全部搬完时，世界末日就要来临了。如果一个教士每秒钟可以移动一次盘子，他的子子孙孙（如果有的话）继承他的事业，需要多少年才可以搬完64个盘。（假设每年都以365天记）。-1 associated with the Tower of Hanoi problem: If there are n plates, a total of how many times you need to move? When the 64