diff --git a/algorithm/sorting/merge/desc.json b/algorithm/sorting/merge/desc.json
index 736cba76..edb6a2a9 100644
--- a/algorithm/sorting/merge/desc.json
+++ b/algorithm/sorting/merge/desc.json
@@ -1,5 +1,5 @@
 {
-  "Quicksort": "In computer science, merge sort (also commonly spelled 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. A detailed description and analysis of bottom-up mergesort appeared in a report by Goldstine and Neumann as early as 1948.",
+  "Mergesort": "In computer science, merge sort (also commonly spelled 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. A detailed description and analysis of bottom-up mergesort appeared in a report by Goldstine and Neumann as early as 1948.",
   "Complexity": {
     "time": "average O(n log n)",
     "space": "worst O(n)"