Algorithms

(1) Percolation:

（http://coursera.cs.princeton.edu/algs4/assignments/percolation.html ）

(no comments)
(Monte Carlo simulation)
(uf2 is a solution for backwash problem)

(2) Queues:

(http://coursera.cs.princeton.edu/algs4/assignments/queues.html )

(2-1) Deques:
(no comments)
(double-ended queue)
(generics)
(iterators)
(LinkedList implementation)

(2-2) Randomized Queues:
(generics)
(iterators)
(ResizingArray implementation)

(2-3) Permutation:
(using Randomized Queues)

(3) CollinearPoints:

(http://coursera.cs.princeton.edu/algs4/assignments/collinear.html )

(Pattern Recognition)

(3-1) Points:
(implements Comparable)
(Comparator by slope)

(3-2) BruteCollinearPoints:
(Brute force)
(Data type immutable)

(3-3) FastCollinearPoints:
(Sorting-based solution)
(not optimized implementation)

(4) 8-Puzzle:

(http://coursera.cs.princeton.edu/algs4/assignments/8puzzle.html )

(A* Search Algorithm)
(PriorityQueue)
(Game Tree)

(5) Kd-Trees:

(http://coursera.cs.princeton.edu/algs4/assignments/kdtree.html )

(2d Trees)
(Range Search)
(Nearest Neighbor Search)
(red-black BST)
(no comments)