func QuickLomuto(list []int) {
	if len(list) > 1 {
		p := 0
		hi := len(list) - 1
		pivot := list[hi]
		for j := 0; j < hi; j++ {
			if list[j] < pivot {
				list[p], list[j] = list[j], list[p]
				p++
			}
		}
		list[p], list[hi] = list[hi], list[p]
		QuickLomuto(list[:p])
		QuickLomuto(list[p+1:])
	}
}
QuickLomuto implements a quick sort algorithm using the Lomuto partitioning
scheme
package sort