登录
首页 » Visual C++ » beipaowenti

beipaowenti

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

代码说明:

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

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

发表评论

0 个回复

  • build_max_heap
    最大堆排序算法,C++语言编写,原程序,算法导论(The maximum heap sort algorithm, C++ language)
    2015-01-26 16:15:21下载
    积分:1
  • pinfanfangwen
    设有一头指针为L的带有表头结点的非循环双向链表,其每个结点中除有prev(前驱指针),data(数据)和next(后继指针)域外,还有一个访问频度域freq。在链表被起用前,其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时,令元素值为x的结点中freq域的值增1,并使此链表中结点保持按访问频度非增(递减)的顺序排列,同时最近访问的结点排在频度相同的结点的最后,以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法,该运算为函数过程,返回找到结点的地址,类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
    2015-01-15 22:31:59下载
    积分:1
  • chechang
    数据结构作业-停车场管理(operating data structure-the car park management)
    2020-06-26 11:00:02下载
    积分:1
  • QuickSort
    快速排序,用数组的存储结构,实现数的排序。共有八组随机数据,还能够计算出每组数据的处理时间,最终得到平均时间。(Quicksort array storage structure, to achieve the sort of number. A total of eight sets of random data, but also be able to calculate the processing time of each data, and eventually obtain the average time.)
    2013-03-22 21:21:16下载
    积分:1
  • elevator
    电梯模拟,实现一个模拟电梯的环境,用C程序实现的,封装良好(elevator modify)
    2021-04-22 15:38:48下载
    积分:1
  • BFS
    迷宫问题 队列求解 界面还不完善 可以自己添加(Maze problem solving interface queue is not perfect you can add your own)
    2013-12-26 22:08:58下载
    积分:1
  • xunhuansaiqxf
    算法课程设计 分治法解决循环赛日程表 源代码+word报告+答辩PPT(Curriculum design of divide and conquer algorithm to solve a round robin schedule report+ source code+ word reply PPT)
    2010-05-26 23:51:17下载
    积分: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
  • examples-of-data-structure
    吴伟民版数据结构每个算法的c实现方法,并模块化处理,将各个功能分开编程,有助于移植使用(failed to translate)
    2013-05-06 13:20:48下载
    积分:1
  • yuesefu
    数据结构经典算法 约瑟夫问题 c++ 已经测试通过(josephus c++)
    2012-12-02 16:23:02下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载