登录
首页 » Visual C++ » beipaowenti

beipaowenti

于 2012-04-10 发布 文件大小:1KB
0 199
下载积分: 1 下载次数: 3

代码说明:

  背包算法的c++简单实现,很有用的,可以看看(Knapsack algorithm)

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

发表评论

0 个回复

  • permutations
    组合数学全排列,包含有六种全排列的方法,字典序法(math of permutations)
    2011-12-12 10:51:16下载
    积分:1
  • shujujiegoukechengshiji
    数据结构课程设计时,所需的封面及任务书版面,希望对大家有点用!(Curriculum design data structure, the necessary task of the book cover and layout, in the hope that we are a bit used!)
    2008-06-16 18:38:51下载
    积分:1
  • select
    采用Dijkstra算法和Floyd算法实现的简单医院选址系统(data structure)
    2009-03-11 20:23:09下载
    积分:1
  • 123
    中科大数据结构全部上机实验的实验程序以及报告,内容包括多项式,图,栈,SQL语言……(All experimental procedures USTC data structures as well as reports on experiments, including polynomial, maps, stack, SQL language ......)
    2020-10-14 19:57:30下载
    积分:1
  • host2
    说明:  马踏棋盘算法编程,实现在棋盘上任意两点间的最短路径求解。(horse riding chessboard programming algorithm to achieve on the chessboard arbitrary 2:00 of finding the shortest path.)
    2006-04-30 00:12:21下载
    积分:1
  • yuesefu
    约瑟夫问题,通过C语言对约瑟夫问题进行了分析和讲解,从而解决问题(Joseph problems, by Joseph C language issues are analyzed and explained, in order to solve the problem)
    2011-10-26 10:56:33下载
    积分:1
  • polynomial
    说明:  线性表的基本运算及多项式的算术运算在顺序表泪SeqList 中增加成员函数void Reverse()实现顺序表的逆置 (Linear form the basic arithmetic operations and the polynomial form in order to increase tear SeqList member function void Reverse () to achieve the inverse order of the table set)
    2010-04-20 20:11:40下载
    积分:1
  • LR(0)
    简单LR语法分析程序自动生成器的实现,可用作数据结构课程设计(LR (0) grammar analysis)
    2013-09-22 09:26:25下载
    积分: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
  • PolynomialCoeff
    NTL应用——大数系数多项式乘法的计算。从文件读如参数,计算多项式相乘后某项的系数(NTL application- the multiplication of big numbers coefficient polynomial )
    2021-04-11 09:58:58下载
    积分:1
  • 696518资源总数
  • 105949会员总数
  • 22今日下载