登录
首页 » Visual C++ » yeschengxu

yeschengxu

于 2013-12-22 发布 文件大小:32KB
0 118
下载积分: 1 下载次数: 4

代码说明:

  这是数据结构很重要的程序,主要是课后题的答案,和代码,功能很强大(the data struct of the book)

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

发表评论

0 个回复

  • 第4章
    清华大学出版社,数据结构简明教程李春葆著,第四章源文件(Tsinghua University press, a brief course on data structure, Li Chunbao, fourth chapters)
    2018-02-03 14:39:12下载
    积分:1
  • zuiyouerfenjiansuozhu
    最优二叉搜索树问题具有最优子结构性质,即其任意一棵子树都是一棵独立的最优二叉搜索树,所以可以采用动态规划方法,并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)
    2013-10-10 18:48:17下载
    积分:1
  • yinhangmoni
    这是一个简单的银行模拟系统 1、 客户的到达时间随机 2、 客户需要处理的业务随机(不同业务处理的平均长度不同,例如:取款时间较短,开户和销户时间较长) 3、 处理客户业务所需时间随机(在一定范围内) 4、 使用文本文件记录每个客户到达时间、业务处理时间、业务结束时间 5、 动态显示(刷新时间可调)目前每个窗口累计处理客户数量、等待人数,每个窗口的平均业务处理时间,不同业务类型业务的累计办理量。 (This is a simple bank simulation system 1 customer arrival time random 2, customers need to deal with the business of random (the average length of the different business processes, such as: the withdrawal shorter, longer to open an account and cancel the account) 3, the time required to deal with customer service random (within certain limits) 4, using a text file to record each customer arrival time, business processing time, the business end of time 5 dynamically display (refresh time is adjustable) each window is accumulated to handle the number of customers waiting for the number the average business processing time of each window, different type of business operations total for the amount.)
    2012-11-22 00:08:18下载
    积分:1
  • X_bit0mintest
    X位赋0mintest是实现芯片功耗测试不确定位填充算法(X-bit chip is to achieve the power conferred 0mintest test uncertain bit stuffing algorithm)
    2011-07-02 21:37:01下载
    积分:1
  • work_std
    工作时单元功能实现的部分资料 主要涉及字符串处理、排序算法,字符串查询、kmp、改进二分法、Unicode编码、uniq(functional modules work to achieve some of the information involved mainly string handling, sorting algorithm, string inquiries, kmp improve dichotomy, Unicode encoding, uniq)
    2007-01-23 08:57:38下载
    积分:1
  • ACRush_2_1
    这是acm高手楼天城的比赛代码,很有用哦,对于提高算法非常有用(This is a master of building Tiancheng acm game code, very useful oh, for improving the algorithm)
    2011-06-16 21:00:05下载
    积分:1
  • crox
    矩形件最优排样的程序,用Visual C编写,在6.0下能正常运行。(Rectangular pieces Optimal Nesting program)
    2013-05-13 14:31:41下载
    积分:1
  • main
    求最长上升下降\非上升非下降的刷表法(Seeking maximum rise fall Philippines rise fall Philippines brush table method)
    2016-03-29 19:29:19下载
    积分: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
  • qiongju
    八皇后算法,用的是最简单的穷举法,在VC++6.0上编写的。(Eight Queens algorithm, using the simplest method of exhaustion, in VC++6.0 written on.)
    2013-08-14 22:21:28下载
    积分:1
  • 696518资源总数
  • 104225会员总数
  • 32今日下载