insertsort.coffee

insertSort = (arr)->
    for i in [1...arr.length]
        for j in [i-1..0]
            if arr[j] > arr[j+1]
                temp = arr[j]
                arr[j] = arr[j+1]
                arr[j+1] = temp
    arr

#test
console.log insertSort [1,2,3,3,4,6, 9, 2, 1]
console.log insertSort [1]
console.log insertSort [0]
console.log insertSort [1,0]
console.log insertSort [1,0,1]