Update README-ko.md

SunggyuLee · web-flow · commit a607bb956118 · 2018-12-16T06:24:03.000+09:00
~merge
diff --git a/README-ko.md b/README-ko.md
@@ -36,15 +36,15 @@ __&#49549;&#49457;__
 ###### View the algorithm in [action][insertion-toptal]
 
 
-### Merge
+### Merge(&#54633;&#48337; &#51221;&#47148;)
 ![alt text][merge-image]
 
-From [Wikipedia][merge-wiki]: In computer science, merge sort (also commonly spelt mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Mergesort is a divide and conquer algorithm that was invented by John von Neumann in 1945.
+From [Wikipedia][merge-wiki]: &#52980;&#54504;&#53552; &#44284;&#54617;&#50640;&#49436;, &#54633;&#48337; &#51221;&#47148;&#51008; &#54952;&#50984;&#51201;&#51064;, &#48276;&#50857;&#51201;&#51064;, &#48708;&#44368; &#44592;&#48152; &#51221;&#47148; &#50508;&#44256;&#47532;&#51608;&#51060;&#45796;. &#45824;&#48512;&#48516;&#51032; &#44396;&#54788;&#51008; &#50504;&#51221;&#51201;&#51064; &#48516;&#47448;&#47484; &#51060;&#47336;&#45716;&#45936;, &#51060;&#44163;&#51008; &#44396;&#54788;&#51060; &#51221;&#47148;&#46108; &#52636;&#47141;&#50640; &#46041;&#51068;&#54620; &#50836;&#49548;&#51032; &#51077;&#47141; &#49692;&#49436;&#47484; &#50976;&#51648;&#54620;&#45796;&#45716; &#44163;&#51012; &#51032;&#48120;&#54620;&#45796;. &#54633;&#48337; &#51221;&#47148;&#51008; 1945&#45380;&#50640; John von Neumann&#51060; &#48156;&#47749;&#54620; &#48516;&#54624; &#51221;&#48373; &#50508;&#44256;&#47532;&#51608;&#51060;&#45796;.
 
 __Properties__
-* Worst case performance    O(n log n) (typical)
-* Best case performance    O(n log n)
-* Average case performance    O(n log n)
+* &#52572;&#50501;&#51032; &#49457;&#45733;    O(n log n) (&#51068;&#48152;&#51201;)
+* &#52572;&#44256;&#51032; &#49457;&#45733;    O(n log n)
+* &#54217;&#44512;    O(n log n)
 
 
 ###### View the algorithm in [action][merge-toptal]
