InsertionSort

InsertionSort.swift

/// from swift-algorithm-club
/// O(n^2)

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


func lessSwap(_ array: [Int]) -> [Int] {
    var a = array
    for x in 1..<a.count {
        var y = x
        let temp = a[y]
        while y > 0 && temp < a[y - 1] {
            a[y] = a[y - 1]
            y -= 1
        }
        a[y] = temp
    }
    return a
}