-
48qqqq
主要用栈和树求解骑士问题，用C++语言编写的(The main stack and tree Cavalier Problem Solving with C++ languages)
- 2009-03-21 22:34:39下载
- 积分：1
-
C-data
大一c语言实验的所有源码以及实验报告报告(All source code and report experimental freshman c language)
- 2016-12-23 23:43:39下载
- 积分：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
-
bTree
这是一个二叉树的工程文件，包括了工程文件里的所有文件。以及二叉树的构建，traverse，搜索等功能函数。(This file contains a summary of what you will find in each of the files that
make up your bTree application.
)
- 2011-05-20 08:12:04下载
- 积分：1
-
binary-tree
数据结构 二叉树的操作，可以对二叉树进行最基本的操作，先建立二叉树。(The operation of the binary tree, binary tree with the most basic operation, first create a binary tree.)
- 2012-03-20 21:19:43下载
- 积分：1
-
paixu
2008软件公司面试题:排序大全：简单选择排序、冒泡排序、选择排序、shell排序、快速排序、插入排序、堆排序(从小到大)、归并排序（利用递归）(2008 software companies face questions: Sort Guinness: simple choice to sort, bubble sort, select sort, shell sort, quick sort, insert sort HEAPSORT (from small to large), Merging Sort (recursive))
- 2008-12-10 16:53:40下载
- 积分：1
-
qiongju
八皇后算法，用的是最简单的穷举法，在VC++6.0上编写的。(Eight Queens algorithm, using the simplest method of exhaustion, in VC++6.0 written on.)
- 2013-08-14 22:21:28下载
- 积分：1
-
FinalExam
C语言期末考试题，含答案。数组、链表、函数等的使用和C编程。(failed to translate)
- 2011-11-07 20:07:25下载
- 积分：1
-
zuiyouerfenjiansuozhu
最优二叉搜索树问题具有最优子结构性质，即其任意一棵子树都是一棵独立的最优二叉搜索树，所以可以采用动态规划方法，并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)
- 2013-10-10 18:48:17下载
- 积分：1
-
stuctures
本系统采用C语言编写，利用邻接链表实现最短路径问题，关键路径问题等(The system uses the C language, using adjacency list realize the shortest path problem, critical path issues)
- 2008-05-29 21:11:26下载
- 积分：1
