So you wanna to implement a algorithm lib to help people to learn how
some algorithm work? That would be great. Some network flow algorithm
is not easy to understand, except with the help of visualization. Some
graph algorithms like convex hull, finding the max distance in a set
of 2d-points( Rota
W words in article. If we do not sort the words, it will take O(WT);
if we sort words in each atilcle, it is O(Wlg(W)+Tlg(W)); or maybe
hash is another choice, it takes O(W+T).
If T is small, just use O(WT) way. Otherwise, use sort or hash
instead.
Roy M wrote:
> Recently need to think of an eff
