Learning KD Tree
Bloom Filter in action
Amazing Horner's rule
Insert Sort Algorithm in Python
How to get the square of N using Newton's method?
How to check two segments cross
container-with-most-water
题目 Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water. Note: You may not slant the container and n is at least 2.