-
Subset
说明： 子集和数问题.rar，用C++写的，可以运行(Subset of several problems. Rar, written in C++, you can run)
- 2010-04-16 17:42:12下载
- 积分：1
-
太阳能电池参数计算器 升级版
太阳能电池参数计算，可以快速方便计算电流，电压，填充因子等参数(Solar cell parameter calculation)
- 2017-11-23 21:30:46下载
- 积分：1
-
host2
说明： 马踏棋盘算法编程，实现在棋盘上任意两点间的最短路径求解。(horse riding chessboard programming algorithm to achieve on the chessboard arbitrary 2:00 of finding the shortest path.)
- 2006-04-30 00:12:21下载
- 积分：1
-
Josephus
实现约瑟夫问题的4种算法，并有计时功能进行效率测试(4 algorithms to resolve Josephus Problem with timing counter for testing efficiency)
- 2012-12-20 12:36:46下载
- 积分：1
-
example-program
里面有50例经典算法，其中包括水仙花素，兔子的繁殖等古典问题的求解(There are 50 cases of classic algorithms, including daffodils prime, rabbit breeding classical problem solving)
- 2013-02-03 11:14:12下载
- 积分：1
-
mofanwenti
魔方问题
数据结构
使用c++
经典问题(Cube problem
Data Structure
Using c++
Classic problem)
- 2014-01-08 22:30:48下载
- 积分：1
-
code
C++实现的两类问题随机森林生成算法，对学习随机森林很有帮助(Source code for random forests,wanderful codes,and help youself to it!)
- 2020-06-29 22:20:02下载
- 积分：1
-
maopao_youhua
冒泡优化：
如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行，优化之后1次就好，也就是说序列越接近于正常序列，改进之后的冒泡排序的次数就越少，这样会给一个冒泡排序算法带了很大的效率。
思想：添加一个boolean变量用来判断冒泡是否是已经排好了顺序，如果boolean的值为false，说明是已经排好了，如果boolean的值true，说明没有排好，继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency.
Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)
- 2012-04-18 00:33:45下载
- 积分：1
-
ok-suit
说明： 一个实现外部排序的程序，其中gnerate.cpp为产生一个随机的文件，用于被排序。而caculate.cpp为外部排序程序。(A realization of the external sort program, which gnerate.cpp to generate a random file for be sorted. The caculate.cpp external sort program.)
- 2011-03-18 12:30:29下载
- 积分：1
-
Project_ShortestPath
任务：实现Dijkstra算法
工程名：Project_ShortestPath
要求：实现Dijkstra算法，算法主体写在CGraph类中；要求是从command窗口中输入源节点编号，并在command窗口中输出从源节点到所有目的节点的最短路长及最短路。注：要输出整条路径，而不仅仅是前一跳，也不允许逆序输出。
(Task: Dijkstra' s algorithm to achieve the project name: Project_ShortestPath requirements: achieve Dijkstra algorithm, the algorithm written in the body CGraph class requires input from the command window, the source node number, and in the command window, all of the output from the source node to the destination node shortest long and the shortest. Note: To export the entire path, not just before the jump, do not allow reverse output.)
- 2013-08-21 16:40:41下载
- 积分：1
