addition of convenience method

Author: JulioBBL

Selection Sort/SelectionSort.playground/Contents.swift

@@ -6,5 +6,6 @@ print("Hello, Swift 4!")
 #endif
 
 let list = [ 10, -1, 3, 9, 2, 27, 8, 5, 1, 3, 0, 26 ]
+selectionSort(list)
 selectionSort(list, <)
 selectionSort(list, >)

Selection Sort/SelectionSort.playground/Sources/SelectionSort.swift

@@ -1,4 +1,4 @@
-public func selectionSort<T: Comparable>(_ array: [T], _ isOrderedBefore: (T, T) -> Bool) -> [T] {
+public func selectionSort<T: Comparable>(_ array: [T]) -> [T] {
   guard array.count > 1 else { return array }
 
   var a = array
@@ -7,7 +7,7 @@ public func selectionSort<T: Comparable>(_ array: [T], _ isOrderedBefore: (T, T)
     // Find the lowest value in the rest of the array.
     var lowest = x
     for y in x + 1 ..< a.count {
-      if isOrderedBefore(a[y], a[lowest]) {
+      if a[y] < a[lowest] {
         lowest = y
       }
     }
@@ -19,3 +19,25 @@ public func selectionSort<T: Comparable>(_ array: [T], _ isOrderedBefore: (T, T)
   }
   return a
 }
+
+public func selectionSort<T>(_ array: [T], _ isLowerThan: (T, T) -> Bool) -> [T] {
+    guard array.count > 1 else { return array }
+    
+    var a = array
+    for x in 0 ..< a.count - 1 {
+        
+        // Find the lowest value in the rest of the array.
+        var lowest = x
+        for y in x + 1 ..< a.count {
+            if isLowerThan(a[y], a[lowest]) {
+                lowest = y
+            }
+        }
+        
+        // Swap the lowest value with the current array index.
+        if x != lowest {
+            a.swapAt(x, lowest)
+        }
+    }
+    return a
+}

Selection Sort/SelectionSort.playground/playground.xcworkspace/xcshareddata/IDEWorkspaceChecks.plist

@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+<dict>
+	<key>IDEDidComputeMac32BitWarning</key>
+	<true/>
+</dict>
+</plist>