Insertion Sort in Swift

func insertionSort(inputData: inout [Int]) {
    for forwardPointer in 1...inputData.count - 1 {
        let selectElement = inputData[forwardPointer]   //Select the element
        var reversePointer = forwardPointer - 1         //Set the reverse pointer
        while (reversePointer >= 0 && selectElement < inputData[reversePointer]) {
            inputData[reversePointer + 1] = inputData[reversePointer]   //move the value forward
            reversePointer -= 1;        //decrease the pointer
        }
        inputData[reversePointer + 1] = selectElement       //store the value at correct place
    }
}