Does the sorting algorithm modify the original array (slice)?

In Go, the standard sort package provides functions for sorting slices. The sorting is done in place, meaning the original slice is modified.

For example, if you have a slice:

nums := []int{3, 1, 4, 2}
sort.Ints(nums)
fmt.Println(nums) // Will output: [1 2 3 4]

After calling sort.Ints(nums), the contents of nums will change — the elements will be sorted within the same slice.

Thus, sorting algorithms in Go do not create a new slice but modify the original one.