reverse_inplace.go

package array

// ReverseInPlace solves the problem in O(n) time and O(1) space.
func ReverseInPlace(list []int, start, end int) {
	for i := start; i < end-i+start; i++ {
		list[i], list[end-i+start] = list[end-i+start], list[i]
	}
}