Hengistchan的博客

《算法》中文第四版—学习资料自己学习算法第四版收集的一些资料，仅供大家参考书对应的主页Algorithms, 4th Edition。这个网站里面给的资源十分的丰富，一定要仔细看看。附带自带类文件的说明书。官方一点：API文档。Coursera配套的公开课。有partI 和 partII 两部分，可以在Coursera上面找到。由于书用了自己的库，在处理输入输出时，都是使用作者编写的I...

4.1 The maximum-subarray problemdivide-and-conquerDivide the problem into a number of subproblems that are smaller instances of the same problem.Conquer the subproblems by solving them recursiv...

Part III Data Structures (chapter 10 ~ chapter 14)Sets are as fundamental to computer science as they are to mathematics. Whereas mathematical sets are unchanging, the sets manipulated by algorithms...

Chapter 10 Elementary Data Structures10.1 Stacks and queuesStacks and queues are dynamic sets in which the element removed from the set by the DELETE operation is prespecified.In a stack, the e...

Chapter 1 The Role of Algorithms in Computing算法解决哪种问题储存分析人类的DNA序列管理和处理互联网数据电子商务中公钥密码和数字签名用线性规划分配稀有资源。。。 。。。NP-complete problemsNo one knows whether or not efficient algorithms exist for NP-...

Chapter 2 Getting Started2.1 Insertion sortinsertion sort is an efficient algorithm for sorting a small number of elements.The pseudocodeINSERTION-SORT(A)1 for j = 2 to A.length2 key = A[j...

快慢指针快慢指针中的快慢指的是移动的步长，即每次向前移动速度的快慢。例如可以让快指针每次沿链表向前移动2，慢指针每次向前移动1次。快慢指针的应用（1）判断单链表是否存在环如果链表存在环，就好像操场的跑道是一个环形一样。此时让快慢指针都从链表头开始遍历，快指针每次向前移动两个位置，慢指针每次向前移动一个位置；如果快指针到达NULL，说明链表以NULL为结尾，没有环。如果快指针追上慢指针，则...

Chapter 2 Getting Starting2.2 Analyzing algorithmsRAM (Random-access memory)A form of computer data storage that stores data and machine code currently being used.In the RAM model, instructions...