use myers as default & update readme/comment

Author: nighca

README.md

@@ -3,6 +3,8 @@ diff-merge
 
 diff & merge algorithm realized with Javascript
 
+There are two compare methods: simple/myers(used as default), while the latter performs better in most situations(O(ND)).
+
 ### Usage
 
  - nodejs
@@ -13,7 +15,7 @@ diff & merge algorithm realized with Javascript
 
  - browser
 
-		<script type="text/javascript" src="../lib/compare.js"></script>
+		<script type="text/javascript" src="../lib/myers-compare.js"></script>
 		<script type="text/javascript" src="../lib/merge.js"></script>
 
 ### Compare
@@ -34,4 +36,6 @@ diff &amp; merge algorithm realized with Javascript
 
 ### Algorithm
 
-http://en.wikipedia.org/wiki/Levenshtein_distance
+SIMPLE: http://en.wikipedia.org/wiki/Levenshtein_distance
+
+MYERS': https://neil.fraser.name/software/diff_match_patch/myers.pdf

index.js

@@ -1,4 +1,9 @@
+/*
+ * Diff & Merge methods
+ * By: [email protected]
+ */
+
 module.exports = {
-	compare: require('./lib/compare'),
+	compare: require('./lib/myers-compare'),
 	merge: require('./lib/merge')
 };

lib/compare.js

@@ -1,3 +1,8 @@
+/*
+ * Simple compare
+ * By: [email protected]
+ */
+
 (function(global, undefined){
 
     var compare = function(cnt1, cnt2, splitter){

lib/merge.js

@@ -1,3 +1,8 @@
+/*
+ * Merge diff results to origin scequence
+ * By: [email protected]
+ */
+
 (function(global, undefined){
 
     var merge = function(cnt, compareResult){

lib/myers-compare.js

@@ -1,3 +1,9 @@
+/*
+ * Compare using myers' LCS/SES algorithm
+ * ( https://neil.fraser.name/software/diff_match_patch/myers.pdf )
+ * By: [email protected]
+ */
+
 (function(global, undefined){
 
     var compare = function(cnt1, cnt2, splitter){