IP屬地：湖北
-
Hashing/Dynamic Programming-week99.1Hashing-17 假設(shè)我們有一個(gè)有大小m的表(哈希表)。 這個(gè)想法是用一個(gè)函數(shù)h: ={1晶通，…，m}(哈希函數(shù))來確定記錄存儲(chǔ)的位置:一個(gè)key k的記錄應(yīng)該存儲(chǔ)在...
-
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子節(jié)點(diǎn)的數(shù)值不能大于它的父節(jié)點(diǎn)保證heap的根節(jié)點(diǎn)是最大的元素狮辽，稱為max-heappriori...
-
Brute Force Algorithms-week3最直接解決問題的方法：蠻力a算法一也，詳盡的尋找所有解決方案 Selection sort String matching Closest pair Exhaustive sea...
-
Algorithm Efficiency-week2Resources consumed: time and space 2.1 在鏈表中找一個(gè)元素 最差的情況是找不到這個(gè)元素椰苟，最差時(shí)間復(fù)雜度為n最好的情況是我們要找的數(shù)就在第...
-
Warshall and Floyd/ Prim and Dijkstra-week1010.1 Warshall：transitive closure-19 沃肖爾算法計(jì)算二元關(guān)系(或有向圖)的傳遞閉包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的區(qū)別在于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 ...
-
喜歡騎行，十幾年來每年騎行一萬多公里讳苦，騎過西藏带膜，新疆，青海鸳谜，四川膝藕，云南。貴州咐扭，芭挽，，想把經(jīng)歷和大家分享蝗肪。（所發(fā)照片均為本人所拍攝）袜爪。
