-
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
-
quicksort
数据结构快速排序例程代码,只要按照例子就可以很容易加入到你的程序当中。(Data Structures quick sort routine code, just follow the example you can easily add them into your program.)
- 2013-05-23 15:05:53下载
- 积分:1
-
111
八皇后问题,用C语言实现,在VC++6.0环境中可以运行!92种答案(Eight queens problem)
- 2012-06-18 21:02:54下载
- 积分:1
-
maze
c语言完成的数据结构几个小算法游戏包括迷宫求解等(C language of complete data structure several small algorithm game includes maze solution, etc
)
- 2012-03-29 20:37:18下载
- 积分:1
-
houzixuandaiwang
猴子选大王是个重要问题猴子选大王是个重要问题猴子选大王是个重要问题(houzixuandawang)
- 2009-05-05 17:00:13下载
- 积分:1
-
kalman_C
说明: 离散随机线性系统的卡尔曼滤波。
其中13lman.c是卡尔曼滤波函数,4rinv.c是滤波函数中用到的矩阵求逆函数,13lman0.c是主程序。(discrete stochastic linear Kalman filtering system. 13lman.c which is the Kalman filter function, 4rinv.c filtering function is used in the matrix inversion function, is the main program 13lman0.c.)
- 2006-03-01 19:20:13下载
- 积分:1
-
arrangement
假设要在足够多的会场里安排一批活动,并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点,不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数,相应于要找的最小会场数。)
对于给定的k 个待安排的活动,编程计算使用最少会场的时间表。
(Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.)
K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)
- 2014-10-22 11:00:45下载
- 积分:1
-
SortDemo
实现排序操作SortDemoSortDemo.rar,很不错的vc源码,希望对大家有所帮助。(To achieve the sorting operation SortDemo SortDemo.rar, very good vc source, we want to help.)
- 2011-09-21 22:16:39下载
- 积分:1
-
Map-four-staining
用不多于四种颜色为地图染色,使相邻的行政区不重色,是计算机科学中著名的“四染色”的典型应用,应用这个思想,是以回溯的算法对一幅给定的地图染色。是对数据结构中栈的应用。(With no more than four colors map staining the adjacent borough is not heavy color, typical applications of computer science "stain" the application of this idea, a backtracking algorithm on a given mapstaining. The application of the stack data structure.)
- 2012-12-05 13:20:37下载
- 积分:1
-
search
数据结构与算法分析的 C++检索代码,很经典(the code of Data structure)
- 2016-12-22 13:30:46下载
- 积分:1