-
multiplication
本程序是用c语言编写的在800位整数之间的乘积运算(This procedure is written in c the 800 integers in the product operation between)
- 2009-05-16 22:04:42下载
- 积分:1
-
sy1.cpp
实验内容:
建立一个包含图书(书号,书名,定价)信息的的链表,并具有如下功能:
(1) 根据指定图书个数,逐个输入图书信息;
(2) 根据书名进行查找,返回此书的书号和定价;
(3) 根据指定的位置可返回相应的图书信息(书号,书名,定价);
(4) 给定一个图书信息,插入到表中指定的位置;
(5) 删除指定位置的图书记录;
(6) 统计表中图书个数。
(It is a good c++.)
- 2012-10-26 15:23:15下载
- 积分:1
-
d
有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)
- 2013-11-29 14:32:18下载
- 积分:1
-
edge-betweenness
计算边介数,复杂网络,中心性计算,介数也可以计算,运用了数据结构,计算大量数据(edge betweenness,complex network, centrality)
- 2021-05-15 01:30:03下载
- 积分:1
-
Josephus
实现约瑟夫问题的4种算法,并有计时功能进行效率测试(4 algorithms to resolve Josephus Problem with timing counter for testing efficiency)
- 2012-12-20 12:36:46下载
- 积分:1
-
tanxinfangfa
说明: 贪心方法是一种改进了的分级处理方法。它首先根据题意,选取一种量度标准。然后按这种量度标准对这n个输入排序,并按排序一次输入一个量。如果这个输入和当前已构成在这种量度意义下的部分最优解加在一起不能产生一个可行解,则不把此解输入加到这部分解中。这种能够得到某种度量意义下的最优解的分级处理方法称为贪心方法。(greedy method is an improvement of the classification methods. According to its first title Italy, and a selection of standards of measurement. Then, under such a standard measure of this sort n input, with an input an order volume. If the input current and constitutes a measure of significance in this part of the optimal solution together not produce a feasible solution. this solution will not put this added to the importation of decomposition. This can be a meaningful measure of the optimal solution hierarchical method, known as greedy method.)
- 2006-05-15 21:50:01下载
- 积分:1
-
KMP
说明: KMP算法的具体实现,能够在O(n+m)时间内找出字串在父串中的位置,n为父串长度,m为字串长度(KMP in the proposed algorithm, can be O (n+ m) time to find the string in the parent string position, n the parent string length, m for the string length)
- 2010-04-28 16:18:00下载
- 积分:1
-
123
校园导航系统
1) 校园景点介:绍介相关景点的有关详细信息。
2) 最佳路线查询:查询校园中任意两点之间所有路线,并提供两点间最短的简单路径。
3) 关节点查询:提供校园图的关节点查询。
4) 多景点最佳路线查询:提供多个景点的最佳线路查询,即求途径这个景点的最佳路径。
(Campus Navigation System 1) campus attractions Introduction: Shao Jie-related attractions for more information. 2) The best route query: Query on campus all the routes between any two points, and provides a simple shortest path between two points. 3) joint points: the key points to provide the campus map queries. 4) The best route queries more attractions: multiple sites to provide the best route queries, that is seeking ways to this spot the best path.)
- 2011-08-25 08:56:05下载
- 积分:1
-
CEIA
POJ141的源代码,以空间换时间,速度很快很好用。(POJ141 the source code for time in space, fast easy to use.)
- 2011-10-25 18:13:24下载
- 积分:1
-
0728-0708-0704
北邮数据结构课程设计大作业之旅行模拟查询系统。可实现多线程多旅客、中途更改计划、动态显示旅客状态等多个需求。已通过验收。(BUPT curriculum design travel query system simulation of large operations. Multithreading enables passengers to change plans midway, dynamic display multiple demands guest status. It has passed inspection.)
- 2021-03-14 12:09:23下载
- 积分:1