Implementation of insertion sort in Swift

insertionSort.swift

// swap
func insertionSort(_ a:[Int]) -> [Int]{
    var array = a
    for i in 1..<array.count{
        var k = i
        while k>0 && array[k-1] > array[k]{
            (array[k-1], array[k]) = (array[k], array[k-1])
            k -= 1
        }
    }
    return array
}

//without swap
func insertionSort(_ a:[Int]) -> [Int]{
    var array = a
    for i in 1..<array.count{
        var k = i
        var temp = a[k]
        while k>0 && array[k-1] > array[k]{
            array[k] = array[k-1]
            k -= 1
        }
        array[k] = temp
    }
    return array
}