2017年09月_MyLinChi

12月 11月 10月 09月 08月 07月 06月 05月 04月 03月 02月 01月

转载算法导论------渐近记号Θ、Ο、o、Ω、ω详解

目录：1.渐近精确界记号：Θ（big-theta）2.渐近上界记号：O(big-oh)3.渐近下界记号：Ω(big-omege)4.非渐近紧确上界：o(小-oh)5.非渐近紧确下界：ω(小-omege)6.渐近记号Θ、Ο、o、Ω、ω关系7.参考资料1.渐近精确界记号：Θ（big-theta）假设算法A的运行时间表达式T1(n)为：T1(n)=30n4+2

2017-09-18 22:18:52 2357

原创 2.2分析算法（随手笔记）

目的：选出一种最有效的算法。描述所用资源和代价的模型：随机访问机（RAM）对INSERTION-SORT的分析：1.重要概念：输入规模，运行时间。2.对于给定规模的输入，插入排序的运行时间依赖于具体的输入。最佳情况的运行时间为an+b，最坏情况的运行时间为an2+bn+c。3.出于对运行时间的保证，往往只求最坏情况运行时间。4.一种简化的抽象：我们真正感兴趣的是运

2017-09-13 21:48:26 320

转载常用排序算法的分类

（由算法导论2.1中的原址排序引出）1、按照待排得记录是否全部被放置到内存中，可以分为内排序与外排序；2、按照是否需要辅助空间，可以分为原址排序与非原址排序3、按照两个相等的数排序后相对位置是否发生变化，可以分为稳定排序和不稳定排序4、按照是否有比较的排序，可以分为基于比较的排序与非基于比较的排序，其中基于比较的排序又可以分为：（1）交换排序：冒泡排序、快速排序（2）插

2017-09-12 23:08:45 446

转载常用的数据结构操作与排序算法的时间和空间复杂度

引言大家好！这篇文章包含了计算机科学中常用算法的时间和空间复杂度。过去准备技术面试的时候，我通常需要花费很多时间去网上搜索这些算法的最好、平均和最坏情况的复杂度，然后把它们归纳总结在一起，使得我在面试问到的时候不会被难住。在过去的几年里，我面试了一些硅谷的创业公司，也有一些像Google, Facebook, Yahoo, LinkedIn, 和 eBay这样的大公司，当我每一次准备面试时

2017-09-12 23:00:16 601

Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conjecture that P -=/= NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of these problems, via polynomial time algorithms, therefore becomes a compelling subject of scientific inquiry in computer science and mathematics. This book presents the theory of approximation algorithms as it stands today. It is reasonable to expect the picture to change with time. This book is divided into three parts. In Part I we cover combinatorial algorithms for a number of important problems, using a wide variety of algorithm design techniques. The latter may give Part I a non-cohesive appearance. However, this is to be expected - nature is very rich, and we cannot expect a few tricks to help solve the diverse collection of NP-hard problems. Indeed, in this part, we have purposely refrained from tightly categorizing algorithmic techniques so as not to trivialize matters. Instead, we have attempted to capture, as accurately as possible, the individual character of each problem, and point out connections between problems and algorithms for solving them. In Part II, we present linear programming based algorithms. These are categorized under two fundamental techniques: rounding and the primaldual schema. But once again, the exact approximation guarantee obtainable depends on the specific LP-relaxation used, and there is no fixed recipe for discovering good relaxations, just as there is no fixed recipe for proving a theorem in mathematics (readers familiar with complexity theory will recognize this as the philosophical point behind the P -=/= NP question).

2020-04-26