added comments to mergeSort.swift

berenyihenrik · web-flow · commit fc6d3e8abce3 · 2021-10-15T16:15:35.000+02:00
diff --git a/sortingAlgo/mergeSort/mergeSort.swift b/sortingAlgo/mergeSort/mergeSort.swift
@@ -1,3 +1,4 @@
+// a function that merges two arrys
 func merge(_ array_1: inout [Int], _ low: Int, _ mid: Int, _ high: Int) {
     var i = low
     var j = mid + 1
@@ -35,6 +36,7 @@ func merge(_ array_1: inout [Int], _ low: Int, _ mid: Int, _ high: Int) {
     }
 }
 
+// the recursive sorting algorithm that divides the array, sorts the two halves and merges them
 func sort(_ array: inout [Int], _ low: Int, _ high: Int) {
     if low < high {
         let mid = (low + high) / 2

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,4 @@`
	`1`	`+// a function that merges two arrys`
`1`	`2`	`func merge(_ array_1: inout [Int], _ low: Int, _ mid: Int, _ high: Int) {`
`2`	`3`	`var i = low`
`3`	`4`	`var j = mid + 1`
`@@ -35,6 +36,7 @@ func merge(_ array_1: inout [Int], _ low: Int, _ mid: Int, _ high: Int) {`
`35`	`36`	`}`
`36`	`37`	`}`
`37`	`38`
	`39`	`+// the recursive sorting algorithm that divides the array, sorts the two halves and merges them`
`38`	`40`	`func sort(_ array: inout [Int], _ low: Int, _ high: Int) {`
`39`	`41`	`if low < high {`
`40`	`42`	`let mid = (low + high) / 2`