README.md in hashdiff-0.0.5 vs README.md in hashdiff-0.0.6

@@ -23,11 +23,10 @@
 * Hash can be represented as a list of (dot-syntax-path, value) pairs. For example, `{a:[{c:2}]}` can be represented as `["a[0].c", 2]`.
 * The change set can be represented using the do-syntax representation. For example, `[['-', 'b.x', 3], ['~', 'b.z', 45, 30], ['+', 'b.y', 3]]`.
 * It compares Arrays using LCS(longest common subsequence) algorithm.
 * It recoganize similar Hashes in Array using a similarity value(0 < similarity <= 1).
 
-
 ## Compatibility
 
 HashDiff is tested against `1.9.2`, `1.9.3` and `ruby-head`. It should work on other versions as well.
 
 ## Usage
@@ -84,9 +83,13 @@
     b = [1, {a: 1, b: 2, c: 3, e: 5}]
 
     diff = HashDiff.diff(a, b) # diff two array is OK
     HashDiff.unpatch!(b, diff).should == a
 
+## Contributors
+
+- @liufengyun
+- @m-o-e
 
 ## License
 
 HashDiff is distributed under the MIT-LICENSE.