chapter 2 ： The Complexity of Algorithms and the Lower Bounds of Problems
来源：互联网 发布：都市年轻人养猫数据 编辑：程序博客网 时间：2024/04/27 18:02
Definition (complexity)
。The space complexity of an algorithm is the amount of memory it needs to run to completion.
。The time complexity of an algorithm is the amount of computer time it needs to run to completion.
。分析算法所需的时间时，不适合用实际的时间来表示，因为每台电脑的执行速度都不相同。
。我们用 program step 来表示一个 program 的执行时间。每个 statement 都算一次。
•For instance: return (a + b + b´c + (a+b-c)/(a+b) + 4.0); 就当作是一个 program step。
。可以在每个 statement 的地方增加一个 counter (global variable)，就可以实际算出每个算法的执行步骤。
赋值语句算一个statement
return s 算一个statement。
- chapter 2 ： The Complexity of Algorithms and the Lower Bounds of Problems
- the control of complexity
- Multiprocess programming - Lower Bounds on the Number of Locations
- Time and Space Complexity of Recursive Algorithms
- Introduction to The Design and Analysis of Algorithms (2)
- Chapter 1 The Role of Algorithms in Computing
- The Importance of Algorithms
- The Importance of Algorithms
- Performance Measure of Algorithms(2)--Space Complexity & Time Complexity
- the Algorithm Complexity of Lazy Evaluation
- the Common Problems of Hibernate
- the concerned problems of cluster
- Check the difficulty of problems
- Check the difficulty of problems
- The Relationship of the Frame, Bounds, and Center Properties Of UIVIEW
- Algorithms and Data Structures: The Science of Computing
- The Tomes of Delphi: Algorithms and Data Structures
- The Program of Algorithms ------- Diveide and Conquer ---- Merge Sort
- 队列的顺序存储结构与操作
- oracle中connect by prior实现递归查询
- 队列的链式存储结构与操作
- Spring MVC学习（二）
- 陈伯雄的论坛文章——实装配和虚装配
- chapter 2 ： The Complexity of Algorithms and the Lower Bounds of Problems
- 集合的运算
- Access数据类型
- 二叉树的建立和访问的方法
- 计算二叉树的结点个数
- sql 2005
- 数组输出
- 打印方阵
- AC WA or PE
