Merge pull request kodecocodes#803 from RandyTheDev/radix-4.2

[Swift 4.2] Radix Sort Migration

Author: kelvinlauKL

Radix Sort/RadixSort.playground/Contents.swift

@@ -1,21 +1,10 @@
 //: Playground - noun: a place where people can play
 
-import Cocoa
-
-// last checked with Xcode 9.0b4
-#if swift(>=4.0)
-print("Hello, Swift 4!")
-#endif
-
 // Test Radix Sort with small array of ten values
 var array: [Int] = [19, 4242, 2, 9, 912, 101, 55, 67, 89, 32]
 radixSort(&array)
 
 // Test Radix Sort with large array of 1000 random values
-var bigArray = [Int](repeating: 0, count: 1000)
-var i = 0
-while i < 1000 {
-  bigArray[i] = Int(arc4random_uniform(1000) + 1)
-  i += 1
-}
+var bigArray = (0..<1000).map { _ in Int.random(in: 1...1000) }
+bigArray
 radixSort(&bigArray)

Radix Sort/RadixSort.playground/Sources/radixSort.swift

@@ -3,7 +3,6 @@
  Sorting Algorithm that sorts an input array of integers digit by digit.
 
  */
-import Foundation
 
 // NOTE: This implementation does not handle negative numbers
 public func radixSort(_ array: inout [Int] ) {

Radix Sort/Tests/RadixSortTests.swift

@@ -9,13 +9,6 @@
 import XCTest
 
 class RadixSortTests: XCTestCase {
-  func testSwift4() {
-    // last checked with Xcode 9.0b4
-    #if swift(>=4.0)
-      print("Hello, Swift 4!")
-    #endif
-  }
-  
   func testCombSort() {
     let expectedSequence: [Int] = [2, 9, 19, 32, 55, 67, 89, 101, 912, 4242]
     var sequence = [19, 4242, 2, 9, 912, 101, 55, 67, 89, 32]