参考： http://www.cs.ucsb.edu/~suri/cs235/ClosestPair.pdfOne dimension, Two dimension, n - dimension

用DFS进行拓扑排序求强连通分量：kosaraju's algorithm 这篇例文比较好 http://scienceblogs.com/goodmath/2007/10/30/computing-strongly-connected-c/Key Lemma：---------------------------------------------------------

题目：Download the text file here. (Right click and save link as)This file contains all of the 100,000 integers between 1 and 100,000 (inclusive) in some random order, with no integer repeated.

--------------------------------------------------------Question 1In this programming problem you'll code up Dijkstra's shortest-path algorithm. Download the text file here. (Right click

Bloom Filter 讲解：http://blog.youkuaiyun.com/jiaomeng/article/details/1495500-----------------------------------------------------------------------------------------------------------------------Pr

Question 5The minimum s-t cut problem is the following. The input is an undirected graph, and two distinct vertices of the graph are labelled "s" and "t". The goal is to compute the minimum cut (i

这周主要解决快排1. 如果pivot不是第一个元素，就把选定的pivot元素和第一个元素swap，然后照流程走2. int ChoosePivot(vector & data, int start, int end) 选择median 元素做pivot的时候，记住中位数middle 不等于 (end - start + 1) / 2，而应该加上起点 middle =  ((end - st