func bubbleSort(list []int) []int {
    n := len(list)
    for i := 0; i < n; i++ {
        for j := n - 1; j > i; j-- {
            if list[j-1] > list[j] {
                list[j-1], list[j] = list[j], list[j-1]
            }
        }
    }
    return list
}

func quickSort(list []int) []int {
    n := len(list)
    if n <= 1 {
        return list
    }
    base := list[0]
    left := []int{}
    right := []int{}
    for i := 1; i < n; i++ {
        if list[i] < base {
            left = append(left, list[i])
        } else {
            right = append(right, list[i])
        }
    }
    return append(append(quickSort(left), base), quickSort(right)...)
}

func mergeSort(list []int) []int {
    n := len(list)
    if n <= 1 {
        return list
    }
    mid := n / 2
    l1 := mergeSort(list[:mid])
    l2 := mergeSort(list[mid:])
    p1, p2 := 0, 0
    l := []int{}
    for {
        if p1 == len(l1) {
            l = append(l, l2[p2:]...)
            break
        }
        if p2 == len(l2) {
            l = append(l, l1[p1:]...)
            break
        }

        if l1[p1] < l2[p2] {
            l = append(l, l1[p1])
            p1++
        } else {
            l = append(l, l2[p2])
            p2++
        }
    }
    return l
}