gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

fix replace code block with blockquote

Browse Source
This commit is contained in:
Randell Dawson
2019-06-20 17:43:06 -07:00
committed by Kristofer Koishigawa
parent 3f56cf6f54
commit 2b553d31b6
1 changed files with 12 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
guide/english/algorithms/sorting-algorithms/merge-sort/index.md
View File

@ -25,18 +25,18 @@ T(n) = 2T(n/2) + n
Counting the number of repetitions of n in the sum at the end, we see that there are lg n + 1 of them. Thus the running time is n(lg n + 1) = n lg n + n. We observe that n lg n + n < n lg n + n lg n = 2n lg n for n>0, so the running time is O(n lg n). Another simple way to remember the time complexity O(n lg n) of merge sort is that it takes roughly log<sub>2</sub><sup>n</sup> steps to split an array of size n to multiple arrays of size one. After each split, the algorithm have to merge 2 sorted arrays into one which can take n steps in total. As a result, the time complexity for merge sort is O(n lg n).
```
MergeSort(arr[], left, right):
If right > l:
1. Find the middle point to divide the array into two halves:
mid = (left+right)/2
2. Call mergeSort for first half:
Call mergeSort(arr, left, mid)
3. Call mergeSort for second half:
Call mergeSort(arr, mid+1, right)
4. Merge the two halves sorted in step 2 and 3:
Call merge(arr, left, mid, right)
```
<blockquote>
MergeSort(arr[], left, right):<br>
If right > l:<br>
&nbsp;&nbsp;1. Find the middle point to divide the array into two halves:<br>
&nbsp;&nbsp;&nbsp;&nbsp;mid = (left+right)/2<br>
&nbsp;&nbsp;2. Call mergeSort for first half:<br>
&nbsp;&nbsp;&nbsp;&nbsp;Call mergeSort(arr, left, mid)<br>
&nbsp;&nbsp;3. Call mergeSort for second half:<br>
&nbsp;&nbsp;&nbsp;&nbsp;Call mergeSort(arr, mid+1, right)<br>
&nbsp;&nbsp;4. Merge the two halves sorted in step 2 and 3:<br>
&nbsp;&nbsp;&nbsp;&nbsp;Call merge(arr, left, mid, right)
</blockquote>
![Merge Sort Algorithm](https://upload.wikimedia.org/wikipedia/commons/thumb/e/e6/Merge_sort_algorithm_diagram.svg/300px-Merge_sort_algorithm_diagram.svg.png)