quicksort.coffee

quickSort = (arr)->
    debugger
    return arr if arr.length < 2
    left = []
    right = []
    for i in [1...arr.length]
        if arr[0] > arr[i]
            left.push arr[i]
        else
            right.push arr[i]
    debugger
    [].concat quickSort(left), arr[0], quickSort(right)
        
#test
console.log quickSort [1,2,3,3,4,6, 9, 2, 1]
console.log quickSort [1]
console.log quickSort [0]
console.log quickSort [1,0]
console.log quickSort [1,0,1]