IP属地：陕西
-
Hashing/Dynamic Programming-week99.1Hashing-17 假设我们有一个有大小m的表(哈希表)。 这个想法是用一个函数h: ={1，…，m}(哈希函数)来确定记录存储的位置:一个key k的记录应该存储在...
-
Balanced Trees/ Time/Space Tradeoffs-week8Approaches to Balanced Binary Search Trees平衡树的方法 Instance simplification approaches: Se...
-
Heapsort / Transform and Conquer-week77.1 heap -13 heap 是complete binary tree子节点的数值不能大于它的父节点保证heap的根节点是最大的元素，称为max-heappriori...
-
Brute Force Algorithms-week3最直接解决问题的方法：蛮力a算法，详尽的寻找所有解决方案 Selection sort String matching Closest pair Exhaustive sea...
-
Algorithm Efficiency-week2Resources consumed: time and space 2.1 在链表中找一个元素 最差的情况是找不到这个元素，最差时间复杂度为n最好的情况是我们要找的数就在第...
-
Warshall and Floyd/ Prim and Dijkstra-week1010.1 Warshall：transitive closure-19 沃肖尔算法计算二元关系(或有向图)的传递闭包transitive closure，以矩阵的形式表示。（...
-
-
Graphs traversal-week4graph traversal is a exhaustive search 图遍历的两种方法depth-firstbreadth-first search 4.1 定义 ：...
-
Decrease-and-Conquer-week5Decrease-and-Conquer-10 Decrease-and-Conquer分为两种和Devide-and-Conquer的区别在于Decrease-and-Co...
-
Divide and Conquer-week6-8/896.Divide and Conquer-11 The divide-and-conquer strategy tries to make the most of this ...
