orcaman · January 1, 2017 20:39
diff --git a/MergeSort.go b/MergeSort.go

 // MergeSort sorts the slice s using Merge Sort Algorithm
 func MergeSort(s []int) []int {
 	if len(s) <= 1 {
 		return s
 	}

 	n := len(s) / 2

 	var l []int
 	var r []int

 	l = MergeSort(s[:n])
 	r = MergeSort(s[n:])

 	return merge(l, r)
 }

	// MergeSort sorts the slice s using Merge Sort Algorithm
	func MergeSort(s []int) []int {
	if len(s) <= 1 {
	return s
	}

	n := len(s) / 2

	var l []int
	var r []int

	l = MergeSort(s[:n])
	r = MergeSort(s[n:])

	return merge(l, r)
	}