Merge pull request kodecocodes#394 from Moon1102/master

update code

Author: kelvinlauKL

Linear Search/LinearSearch.swift

@@ -4,3 +4,7 @@ func linearSearch<T: Equatable>(_ array: [T], _ object: T) -> Int? {
   }
   return nil
 }
+
+func linearSearch1<T: Equatable>(_ array: [T], _ object: T) -> Array<T>.Index? {
+    return array.index { $0 == object }
+}

Radix Sort/RadixSortExample.swift

@@ -0,0 +1,29 @@
+//
+//  RadixSortExample.swift
+//  
+//
+//  Created by Cheer on 2017/3/2.
+//
+//
+
+import Foundation
+
+func radixSort1(_ arr: inout [Int]) {
+   
+    var temp = [[Int]](repeating: [], count: 10)
+    
+    for num in arr { temp[num % 10].append(num) }
+    
+    for i in 1...Int(arr.max()!.description.characters.count) {
+        
+        for index in 0..<temp.count {
+           
+            for num in temp[index] {
+                temp[index].remove(at: temp[index].index(of: num)!)
+                temp[(num / Int(pow(10, Double(i)))) % 10].append(num)
+            }
+        }
+    }
+    
+    arr = temp[0]
+}

Select Minimum Maximum/README.markdown

@@ -68,6 +68,13 @@ array.minElement()   // This will return 3
 array.maxElement()   // This will return 9
 ```
 
+```
+let array = [ 8, 3, 9, 4, 6 ]
+//swift3
+array.min()   // This will return 3
+array.max()   // This will return 9
+```
+
 ## Maximum and minimum
 
 To find both the maximum and minimum values contained in array while minimizing the number of comparisons we can compare the items in pairs.