-
text
输入N个点的坐标,判断这N个点能否构成一个凸多边形。(Enter the coordinates of N points, to determine whether the N points form a convex polygon.)
- 2011-12-13 09:43:42下载
- 积分:1
-
erchashu
二叉树的链式存储、先序中序遍历和层次遍历。(构造一棵树并输入数据,编写三个函数,非别是树的前序递归遍历算法、树的后序递归遍历算法、树的非递归中序遍历算法(这里的非递归以中序为例)。在主程序中调用这三个函数进行树的遍历,观察用不同的遍历方法输出的数据的顺序和验证递归与非递归输出的数据是否一样。)(Chain store binary tree, preorder traversal and hierarchy traversal.)
- 2013-12-07 23:16:06下载
- 积分:1
-
sort
归并排序,复习排序算法,在不同环境下,寻找时间复杂度最少的排序算法(
Merge sort, review sorting algorithm, in different contexts, looking for the least time complexity of sorting algorithm)
- 2013-11-05 22:15:57下载
- 积分:1
-
mapsearch
数据结构,关键路径问题,设计并实现关键路径的一种应用,采用图的算法(Data structure, critical path problem, using graph algorithm)
- 2016-01-09 17:34:45下载
- 积分:1
-
Josephus
实现约瑟夫问题的4种算法,并有计时功能进行效率测试(4 algorithms to resolve Josephus Problem with timing counter for testing efficiency)
- 2012-12-20 12:36:46下载
- 积分:1
-
graph-DFS
邻接表存储图,然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)
- 2013-10-27 20:16:41下载
- 积分:1
-
48qqqq
主要用栈和树求解骑士问题,用C++语言编写的(The main stack and tree Cavalier Problem Solving with C++ languages)
- 2009-03-21 22:34:39下载
- 积分:1
-
LCS
the longest common serials
- 2011-12-13 00:32:40下载
- 积分:1
-
bag1
使用不同的方法解决背包问题:本算法采用的是动态规划方法,比较好的解决背包问题。(Use different methods to solve knapsack problem: The algorithm is a dynamic programming approach, a better solution to knapsack problem.)
- 2011-07-16 18:40:31下载
- 积分:1
-
migong
输入迷宫行列数,1代表墙0代表路,之后系统生成路径(Enter the maze ranks number 1 represents 0 for Wall Road, after the system-generated path)
- 2016-05-14 20:16:00下载
- 积分:1