Insertion Sort with Swift

InsertionSort.swift

func insertionSort(forInput input: inout [Int]) {
    let uptoIndex = input.count - 1
    
    for rearIndex in 1...uptoIndex {
        
        let rearValue = input[rearIndex]
        var currentRunningIndex = rearIndex
        
        while currentRunningIndex > 0 && input[currentRunningIndex - 1] > rearValue {
            input[currentRunningIndex] = input[currentRunningIndex - 1]
            currentRunningIndex -= 1
        }
        
        input[currentRunningIndex] = rearValue
    }
}

var unorderedArray = [1,5,3,9,7]
insertionSort(forInput: &unorderedArray)
print(unorderedArray)