登录
首页 » Visual C++ » yinhangjiasuanfa

yinhangjiasuanfa

于 2008-06-14 发布 文件大小:1227KB
0 346
下载积分: 1 下载次数: 4

代码说明:

  一个很好的银行家算法,能运行(A good banker s algorithm, will be able to run)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Is_BST
    This is a C++ code. It finds out if the tree is a binary search tree (BST)or not, where the BST is one of data structures types.
    2012-02-02 05:45:59下载
    积分:1
  • zhaose
    本代码是通过C语言来实现贪心算法求着色问题,包括具体问题和实现代码(This code is the C language to implement the greedy algorithm for the coloring problem, including specific issues and the implementation code)
    2013-09-23 16:04:24下载
    积分:1
  • strcon
    对于给定的n个字符串,请找出一种最佳的连接方式,使得采用该连接方式得到的字符串在所有连接的结果中,字典序最小(For a given n-string, find an optimal connection, making use of the connection string to get the results in all connections, the lexicographic minimum)
    2011-09-02 16:52:40下载
    积分:1
  • Monkeys-and-peach
    Monkeys and peach,Monkeys and peach(Monkeys and peach)
    2013-09-01 22:06:42下载
    积分: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
  • maopao_youhua
    冒泡优化: 如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行,优化之后1次就好,也就是说序列越接近于正常序列,改进之后的冒泡排序的次数就越少,这样会给一个冒泡排序算法带了很大的效率。 思想:添加一个boolean变量用来判断冒泡是否是已经排好了顺序,如果boolean的值为false,说明是已经排好了,如果boolean的值true,说明没有排好,继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency. Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)
    2012-04-18 00:33:45下载
    积分:1
  • ds-labs
    说明:  数据结构基本算法实现。包括栈、二叉树基本运算实现,同时包含整数计算器的完整实现。(The basic algorithm data structure. Including implementation of stack, binary tree basic operations, and a complete implementation of an integer calculator.)
    2011-03-27 03:01:02下载
    积分:1
  • examples-of-data-structure
    吴伟民版数据结构每个算法的c实现方法,并模块化处理,将各个功能分开编程,有助于移植使用(failed to translate)
    2013-05-06 13:20:48下载
    积分:1
  • Fund6-StringViewer
    字符串,实现了文件中查找想要的字符串,并将其标记出来
    2010-12-26 20:51:45下载
    积分:1
  • Graph
    数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)
    2013-11-28 10:53:29下载
    积分:1
  • 696518资源总数
  • 106215会员总数
  • 5今日下载