-
communication
VC简易通讯录,加强C的编程,熟悉链表文件的使用等。(Simple VC contacts, strengthen C programming, familiar with the use of a linked list file.)
- 2012-09-02 17:11:12下载
- 积分:1
-
111
八皇后问题,用C语言实现,在VC++6.0环境中可以运行!92种答案(Eight queens problem)
- 2012-06-18 21:02:54下载
- 积分: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
-
LStack
堆栈实现C++,以VC++环境为准——逍遥大洋至上(The stack of the C++, VC++ environment will prevail)
- 2012-03-26 08:35:26下载
- 积分: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
-
C-data
大一c语言实验的所有源码以及实验报告报告(All source code and report experimental freshman c language)
- 2016-12-23 23:43:39下载
- 积分:1
-
josephus
通过c语言数组算法解决josephus问题,m个人围成一圈,从第一个小孩开始顺时针方向每数到第n个小孩时这个小孩离开,最后剩下的小孩是胜利者。求第几个小孩为胜利者(C language array algorithm to solve the Josephus problem, m individual circle, from the first child began to count clockwise every n children, the child left, and finally the remaining child is the winner. A few kids for victory)
- 2017-11-12 10:30:06下载
- 积分:1
-
data-structure-paper
本资料为数据结构的相关试卷,可以帮助大家解决一下有关考试的问题(This information is relevant papers data structure that can help you solve the problems concerning the examination)
- 2013-09-18 08:16:24下载
- 积分:1
-
zhebanchazhao
这半查找法 是一种快速查找算法 查找效率比较高 容易实现 理想的查找算法(This search method is a fast and find more efficient algorithms to find easy to implement the ideal search algorithm)
- 2012-05-04 00:03:29下载
- 积分:1
-
最小生成树
给定一个带权的无向连通图,如何选取一棵生成树,使树上所有边上权的总和为最小(Given a weighted undirected connected graph, how to select a spanning tree to minimize the sum of all the upper bounds on the tree)
- 2017-06-05 17:27:17下载
- 积分:1