登录
首页 » 数据结构 » 算法导论(中文版),讲述了现代计算机常用数据结构和算法

算法导论(中文版),讲述了现代计算机常用数据结构和算法

于 2022-08-10 发布 文件大小:24.41 MB
0 218
下载积分: 2 下载次数: 2

代码说明:

算法导论(中文版),讲述了现代计算机常用数据结构和算法-this book intrdduce the basic algorithm,the language is chinese

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

发表评论

0 个回复

  • 这次毕业设计的内容,计算机库所需的翻译…
    计算机数据库方面的有关内容,对需要毕业设计的外文翻译的同学有用-Computer database of the contents of the graduation project required the translation of foreign language students useful
    2022-02-26 23:31:38下载
    积分:1
  • FORTRAN常用算法集。
    fortran常用算法集。-FORTRAN commonly used algorithm sets.
    2022-05-20 06:32:47下载
    积分:1
  • 题目:设计一个题目,演示用算符优先法对算术表达式求值的过程。 概要设计 1、顺序扫描中缀算术表达式,当读到字时直接将其送至输出队列中; 2、当读到...
    题目:设计一个题目,演示用算符优先法对算术表达式求值的过程。 概要设计 1、顺序扫描中缀算术表达式,当读到数字时直接将其送至输出队列中; 2、当读到运算符时,将栈中所有优先级高于或等于该运算符弹出,送至输出队列中,再将当前运算符入栈; 3、当读入左括号时,即入栈; 4、当读到右括号时,将靠近栈顶的第一个左括号上面的运算符全部一次弹出,送至输出队列中,再删除栈中的左括号。 5、使用VS栈来存储读入的操作和运算结果,然后进行数字字符到数值的转换。 -Title: Design of a topic, presentation operator priority method with arithmetic expression evaluation process. Summary of design 1, the order of scanning arithmetic infix expressions, when they read numbers directly to the output queue 2, when they read operator, it will stack all priority higher than or equal to the operator pop-up , sent to the output queue, and then the current operator入栈 3, when read left brackets, that is, when入栈 4, when they read the right brackets, it will be near the Top-left of the first operator in brackets above All a pop-up, sent to the output queue, and then delete stacks of left brackets. 5, the use of VS stack to store read operation and computing the results of numeric characters and then proceed to the numerical co
    2022-03-18 20:45:34下载
    积分:1
  • 使用SQLite库的简单(C #程序)
    资源描述该方案旨在为用户数据的工作提供指导,并在示例代码中的数据库中执行所有操作,例如已实施的行动:添加在SQLite  记录;编辑记录SQLite  ;-删除在SQLite  记录;•显示批记录发现在SQLite  特定记录;等等等等。
    2022-01-22 16:21:58下载
    积分:1
  • 使用PB实现取得多网卡ip GetIP支持多网卡
    使用PB实现取得多网卡ip GetIP支持多网卡-More than the realization of the use of PB card adapter supports multi-ip GetIP
    2022-04-19 23:04:13下载
    积分:1
  • 这是传统智能优化背包问题用VC++ 6.0的实现,是对背包问题分支限界的可视化算法实现...
    这是传统智能优化背包问题用VC++ 6.0的实现,是对背包问题分支限界的可视化算法实现-This is a traditional intelligent optimization knapsack problem VC++ 6.0 with the realization of knapsack problem is the visualization of branch and bound algorithm
    2022-02-15 16:24:31下载
    积分:1
  • create an Access Database
    使用ADO Reviewed版本1.1.0创建Access 2000数据库!
    2022-07-18 12:34:06下载
    积分:1
  • /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means...
    迷宫算法(maze) /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.
    2022-08-08 06:28:42下载
    积分:1
  • Dijkstra algorithm, can solve the graph theory in the shortest path between two
    Dijkstra算法,可以求解图论中两点之间的最短路径
    2022-01-21 05:12:31下载
    积分:1
  • 多项式总和的链表
    数据结构中的链表类实现多项式的相加 用C++实现!-Linked list data structure in the sum of polynomial-type implementation with C++ implementation!
    2022-08-24 18:03:49下载
    积分:1
  • 696518资源总数
  • 106235会员总数
  • 12今日下载