groovy快速排序

1，groovy快速排序算法

详细代码参见listInAction.groovy

def quickSort(list){
    if (list.size() < 2) return list
    def pivot = list[list.size().intdiv(2)]
    def left = list.findAll { it < pivot }
    def middle = list.findAll { it == pivot }
    def right = list.findAll { it > pivot }
    return (quickSort(left) + middle + quickSort(right))
}

代码太简洁了，有么有