update README

Author: mincong-h

8puzzle/README.md

@@ -20,10 +20,8 @@ For more informations, check the [official assignment description][1].
 
 ## How to compile
 
-* Mac OS / Linux / Windows
+Mac OS / Linux / Windows
 
-  ```
-  javac -cp ../lib/* Board.java Solver.java
-  ```
+    javac -cp ../lib/* Board.java Solver.java
 
 [1]: http://coursera.cs.princeton.edu/algs4/assignments/8puzzle.html

README.md

@@ -19,9 +19,11 @@ Week 1 | [Percolation][w1] | 100/100
 Week 2 | [Queues][w2] | 100/100
 Week 3 | [Collinear][w3] | 100/100
 Week 4 | [8puzzle][w4] | 100/100
+Week 5 | [Kd-Trees][w5] | 100/100
 
 [1]: https://www.coursera.org/learn/introduction-to-algorithms
 [w1]: http://coursera.cs.princeton.edu/algs4/assignments/percolation.html
 [w2]: http://coursera.cs.princeton.edu/algs4/assignments/queues.html
 [w3]: http://coursera.cs.princeton.edu/algs4/assignments/collinear.html
 [w4]: http://coursera.cs.princeton.edu/algs4/assignments/8puzzle.html
+[w5]: http://coursera.cs.princeton.edu/algs4/assignments/kdtree.html

collinear/README.md

@@ -1,14 +1,16 @@
-# How to run
+# Pattern Recognition
 
 Given a set of _n_ distinct points in the plane, find every (maximal) line
 segment that connects a subset of 4 or more of the points. For more
 informations, check [the official assignment description][1].
 
-## Mac OS / Linux
+## How to compile
+
+Mac OS / Linux
 
     $ javac -cp ".:../lib/*" FastCollinearPoints.java BruteCollinearPoints.java Point.java
 
-## Windows
+Windows
 
     $ javac -cp ".;../lib/*" FastCollinearPoints.java BruteCollinearPoints.java Point.java
 

kdtree/README.md

@@ -0,0 +1,17 @@
+# Kd-Trees
+
+Write a data type to represent a set of points in the unit square (all points
+have x- and y-coordinates between 0 and 1) using a 2d-tree to support efficient
+range search (find all of the points contained in a query rectangle) and nearest
+neighbor search (find a closest point to a query point). 2d-trees have numerous
+applications, ranging from classifying astronomical objects to computer
+animation to speeding up neural networks to mining data to image retrieval. For
+more information, check [the official assignment description][1].
+
+## How to compile
+
+Mac OS / Linux / Windows
+
+    javac -cp ../lib/* PointSET.java KdTree.java
+
+[1]: http://coursera.cs.princeton.edu/algs4/assignments/kdtree.html

percolation/README.md

@@ -1,17 +1,19 @@
-# How to run
+# Percolation
 
 The program `PercolationStats` takes two command-line arguments _n_ and _T_,
 performs _T_ independent computational experiments on an _n_ * _n_ grid, and
 prints the mean, standard deviation, and the 95% confidence interval for the
 percolation threshold. For more informations, check [the official assignment
 description][1].
 
-## Mac OS / Linux
+## How to compile and run
+
+Mac OS / Linux
 
     $ javac -cp ../lib/* Percolation.java PercolationStats.java
     $ java -cp "../lib/*:." PercolationStats 200 1000
 
-## Windows
+Windows
 
     $ javac -cp ../lib/* Percolation.java PercolationStats.java
     $ java -cp "../lib/*;." PercolationStats 200 1000

queues/README.md

@@ -1,4 +1,4 @@
-# How to run
+# Deques and Randomized Queues
 
 The client program `Subset.java` takes a command-line integer _k_; reads in a
 sequence of _N_ strings from standard input using `StdIn.readString()`; and
@@ -7,13 +7,15 @@ can be printed out at most once. You may assume that _0 ≤ k ≤ n_, where _n_
 the number of string on standard input. For more information, check [the
 official assignment description][1].
 
-## Mac OS / Linux
+## How to compile and run
+
+Mac OS / Linux
 
     $ javac -cp ../lib/* Deque.java RandomizedQueue.java Subset.java
     $ echo A B C D E F G H I | java -cp ".:../lib/*" Subset 3
     $ echo AA BB BB BB BB BB CC CC | java -cp ".:../lib/*" Subset 8
 
-## Windows
+Windows
 
     $ javac -cp ../lib/* Deque.java RandomizedQueue.java Subset.java
     $ echo A B C D E F G H I | java -cp ".;../lib/*" Subset 3