Commit f62636b

authored

Update 5.mergeSort.md

1 parent 0c614a8 commit f62636bCopy full SHA for f62636b

File tree

-2

lines changed

-2

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -247,8 +247,8 @@ void merge(vector<int>& nums, int l, int mid, int r) {`
`247`	`247`	`}`
`248`	`248`	`copy(tempary.begin(), tempary.begin() + index, nums.begin() + l);`
`249`	`249`	`}`
`250`		`-void mergeSort(vector<int>& nums, int l, int r) {// range is [l, r), so if there is a 0-index array arr whose length is n, "mergeSort(arr, 0, n)" should be called`
`251`		`- if (r - l <= 1) {`
	`250`	`+void mergeSort(vector<int>& nums, int l, int r) {// sort the range [l, r), so if there is a 0-index array arr whose length is n`
	`251`	`+ if (r - l <= 1) { //and you want sort the whole array, "mergeSort(arr, 0, n)" should be called`
`252`	`252`	`return;`
`253`	`253`	`}`
`254`	`254`	`int mid = (l + r) / 2;`

Comments

(0)