Implementation of insertion sort algorithm in Swift

InsertionSort.swift

func insertionSort <T: Comparable>(array: inout [T]) {
    if array.isEmpty {
        return
    }
    
    for i in 1..<array.count {
        var pos = i
        let temp = array[i]
        
        while pos > 0 && array[pos - 1] > temp {
            array[pos] = array[pos - 1]
            pos -= 1
        }
        array[pos] = temp
    }
}