diff --git a/_sources/SortSearch/TheMergeSort.rst b/_sources/SortSearch/TheMergeSort.rst
index 2f50bc0c..6ea170ff 100644
--- a/_sources/SortSearch/TheMergeSort.rst
+++ b/_sources/SortSearch/TheMergeSort.rst
@@ -196,7 +196,7 @@ sets.
:feedback_c: Remember mergesort doesn't work on the right half of the list until the left half is completely sorted.
:feedback_d: This is the list after 4 recursive calls
- Given the following list of numbers:
[21, 1, 26, 45, 29, 28, 2, 9, 16, 49, 39, 27, 43, 34, 46, 40]
which answer illustrates the list to be sorted after 3 recursive calls to mergesort?
+ Given the following list of numbers: [21, 1, 26, 45, 29, 28, 2, 9, 16, 49, 39, 27, 43, 34, 46, 40] which answer illustrates the list to be sorted after 3 recursive calls to mergesort?
.. mchoice:: question_sort_6
:correct: c
@@ -209,5 +209,5 @@ sets.
:feedback_c: The lists [21] and [1] are the first two base cases encountered by mergesort and will therefore be the first two lists merged.
:feedback_d: Although 9 and 16 are next to each other they are in different halves of the list starting with the first split.
- Given the following list of numbers:
[21, 1, 26, 45, 29, 28, 2, 9, 16, 49, 39, 27, 43, 34, 46, 40]
which answer illustrates the first two lists to be merged?
+ Given the following list of numbers: [21, 1, 26, 45, 29, 28, 2, 9, 16, 49, 39, 27, 43, 34, 46, 40] which answer illustrates the first two lists to be merged?