Code sorting algorithm

Question

Accepted Answer

Implement a code sorting algorithm for an array of strings.

Use built-in sorting functions like sort.Strings() in Go.
Implement custom sorting functions using interfaces like sort.Interface.
Consider the time complexity of the sorting algorithm used.

Accepted Answer

func MergeSort(arr []int) []int { // arr := []int{3, 1, 4, 1, 5, 2, 10, 56, 6} if len(arr) <= 1 { return arr } mid := len(arr) / 2 left := MergeSort(arr[:mid]) fmt.Printf("left: %v ", left) right := MergeSort(arr[mid:]) return Merge(left, right) } func Merge(left, right []int) []int { result := make([]int, 0, len(left)+len(right)) for len(left) > 0 || len(right) > 0 { if len(left) == 0 { return append(result, right...) } if len(right) == 0 { return append(result, left...) } if left[0] <= right[0] { result = append(result, left[0]) left = left[1:] } else { result = append(result, right[0]) right = right[1:] } } return result }