Tag: 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. [code language=”swift”]var inputArr:[Int] = [Int]() // generate random numbers for rIndex in 0..<10 { inputArr.append(((Int(arc4random()) % 100)))…