Insertion Sort

Insertion Sort algorithm does the following

  • Keeps the sorted numbers from left to right.
  • Compares the left with right and interchanges the number if left is greater than right.

Here is code snippet of Insertion Sort in Swift.

var inputArr:[Int] = [Int]()

// generate random numbers
for rIndex in 0..<10 {
    inputArr.append(((Int(arc4random()) % 100)))

func insertionSort(var inputArray :[Int]) -> [Int] {
    var jIndex:Int,kIndex:Int

    for kIndex in 1.. 0 && inputArray[jIndex-1] >= temp ) {
            inputArray[jIndex] = inputArray[jIndex-1]
        inputArray[jIndex] = temp

    return inputArray

In Category: Mac, Programming, Xcode

Ravi Shankar

A polyglot software developer and now exploring Swift and iOS development. If you would like to learn from me then check out services page.

Show 2 Comments
  • Laurent July 4, 2015, 4:02 pm

    Does not work, you cannot swap values doing this.

    • rshankar July 4, 2015, 4:45 pm

      I have fixed the code which was written during Swift beta release. Can you pls try now and let me know if this is still an issue.


Leave a Comment