2016 Update

Task/Sorting-algorithms-Merge-sort/00DESCRIPTION

@@ -1,11 +1,25 @@
-{{Sorting Algorithm}}[[Category:Recursion]]The '''merge sort''' is a recursive sort of order n*log(n).
-It is notable for having a worst case and average complexity of ''O(n*log(n))'', and a best case complexity of ''O(n)'' (for pre-sorted input).
-The basic idea is to split the collection into smaller groups by halving it until the groups only have one element or no elements (which are both entirely sorted groups).
-Then merge the groups back together so that their elements are in order.
-This is how the algorithm gets its "divide and conquer" description.
+{{Sorting Algorithm}}
+[[Category:Recursion]]
 
+The &nbsp; '''merge sort''' &nbsp; is a recursive sort of order &nbsp; <big> n*log(n). </big>
+
+It is notable for having a worst case and average complexity of &nbsp; <big> ''O(n*log(n))'', </big> &nbsp; and a best case complexity of &nbsp; <big> ''O(n)'' &nbsp; </big> (for pre-sorted input).
+
+The basic idea is to split the collection into smaller groups by halving it until the groups only have one element or no elements &nbsp; (which are both entirely sorted groups).
+
+Then merge the groups back together so that their elements are in order.
+
+This is how the algorithm gets its &nbsp; ''divide and conquer'' &nbsp; description.
+
+
+;Task:
 Write a function to sort a collection of integers using the merge sort.
-The merge sort algorithm comes in two parts: a sort function and a merge function.
+
+
+The merge sort algorithm comes in two parts:
+    a sort function     and
+    a merge function
+
 The functions in pseudocode look like this:
  '''function''' ''mergesort''(m)
     '''var''' list left, right, result
@@ -40,6 +54,10 @@ The functions in pseudocode look like this:
         '''append''' rest(right) '''to''' result
     '''return''' result
 
-For more information see [[wp:Merge_sort|Wikipedia]]
 
-Note: better performance can be expected if, rather than recursing until length(m) ≤ 1, an insertion sort is used for length(m) smaller than some threshold larger than 1. However, this complicates example code, so is not shown here.
+;See also:
+* &nbsp; the Wikipedia entry: &nbsp; [[wp:Merge_sort| merge sort]]
+
+
+Note: &nbsp; better performance can be expected if, rather than recursing until &nbsp; <big> length(m) ≤ 1, </big> &nbsp; an insertion sort is used for &nbsp; <big> length(m) </big> &nbsp; smaller than some threshold larger than &nbsp; '''1'''. &nbsp; However, this complicates the example code, so it is not shown here.
+<br><br>