登录
首页 » Visual C++ » Data-Structure11-15

Data-Structure11-15

于 2014-05-30 发布 文件大小:4307KB
0 285
下载积分: 1 下载次数: 5

代码说明:

   本书是关于计算机科学与工程领域的基础性研究科目之一——数据结构与算法的专著。 本书在简要回顾了基本的C++ 程序设计概念的基础上,全面系统地介绍了队列、堆栈、树、图等基本数据结构,以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法,为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是,本书不仅仅介绍了理论知识,还提供了50多个应用实例及600多道练习题。 本书内容广博权威,结构清晰合理,是一本全新的有关数据结构与算法的教材,对于计算机科学与工程领域的从业人员也是一本很好的参考书。 11-15章 (This book is about the field of computer science and engineering subjects of basic research- data structures and algorithms monographs. In a brief review of the book based on the basic concept of C++ programming on a comprehensive and systematic introduction to the queues, stacks, trees, graphs and other basic data structures, and the greedy algorithm, a variety of algorithms divide and conquer algorithms, branch and bound algorithm design method for data structures and algorithms continue to learn and study laid a solid foundation. More valuable is the book not only theoretical knowledge, but also provides more than 50 application examples and more than 600 channel exercises. Book a broad authority, clear and reasonable structure, is a new data structures and algorithms related materials, for the field of computer science and engineering practitioners also a good reference book. Chapter 11-15)

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

发表评论

0 个回复

  • Bigint
    利用双向链表实现对两大整数的相加运算。 可以修改数组长度实现更大整数的相加(Realize the use of two-way linked list of integers the sum of the two operations. Can modify the array length to achieve a greater sum of integers)
    2007-10-18 21:34:06下载
    积分:1
  • 哈夫曼树解码和编码
    哈夫曼树,基本的数据结构,用来编码和解码、用数组作为存储结构实现,
    2023-04-13 11:00:11下载
    积分:1
  • Campus-navigation-system
    校园导航系统包含佛山科技学院本部校区的校园景点平面图。通过系统的各功能不仅可以查询任意景点的编号,名称,简介等信息,还可以查询任意两景点间的最短路径及长度和所有路径及长度。另外,还可以通过一系列操作增加,更改或删除任意的景点的各信息。(Contains the campus attractions plan of the campus Foshan Institute of Technology campus navigation system. Through the function of the system not only can query any spots number, name, profile and other information, can also query the shortest path and arbitrary length between two spots and all paths and the length of. In addition, can also increase through a series of operations, the information change or delete any of the attractions.)
    2015-05-09 16:19:30下载
    积分:1
  • suanfa
    匈牙利算法以及指派问题介绍,kM算法和匈牙利算法的程序代码(Hungarian algorithm and the assignment problem introduced, kM algorithm and the Hungarian algorithm code)
    2011-09-10 09:42:39下载
    积分:1
  • bTree
    这是一个二叉树的工程文件,包括了工程文件里的所有文件。以及二叉树的构建,traverse,搜索等功能函数。(This file contains a summary of what you will find in each of the files that make up your bTree application. )
    2011-05-20 08:12:04下载
    积分:1
  • nuaa1507_DancingLink_trackback.cpp
    高德纳发明的高效数据结构dancing link,这里是解重复覆盖问题的一个演示(Donald Knuth invented efficient data structure dancing link, here is the solution to repeat coverage of a demonstration)
    2010-03-07 10:54:32下载
    积分:1
  • hafumanTree
    数据结构课程设计,在VC环境下完成,利用哈夫曼树原理,主要功能是实现字符的压缩和解压缩,设计脉络清晰,易懂(Data structure course design, completed in the VC environment, using Huffman tree principle, the main function is to achieve the character of the compression and decompression, design, clear structure, easy to understand)
    2011-01-02 13:15:23下载
    积分:1
  • improvedKMPalgorithm
    大学计算机专业,数据结构中的改进的KMP算法,C++编写。(University computer science, data structures to improve the KMP algorithm, C++ written.)
    2010-05-24 12:45:20下载
    积分: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
  • dijkstra
    dijkstra算法,用于寻找已建立图的最短路径,是非常有用的一个算法(Dijkstra algorithm, has been established for finding the shortest path map is a very useful algorithm)
    2007-07-15 14:14:48下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载