Merge pull request kodecocodes#902 from freak4pc/quicksort-swap

Use swapAt for Lomuto's partitioning
IanTaehoonYoo · Dec 3, 2019 · 942064d · 942064d
2 parents 055cb68 + 0904c23
commit 942064d
Show file tree

Hide file tree

Showing 2 changed files with 4 additions and 4 deletions.
diff --git a/Quicksort/Quicksort.playground/Contents.swift b/Quicksort/Quicksort.playground/Contents.swift
@@ -42,12 +42,12 @@ func partitionLomuto<T: Comparable>(_ a: inout [T], low: Int, high: Int) -> Int
   var i = low
   for j in low..<high {
     if a[j] <= pivot {
-      (a[i], a[j]) = (a[j], a[i])
+      a.swapAt(i, j)
       i += 1
     }
   }
 
-  (a[i], a[high]) = (a[high], a[i])
+  a.swapAt(i, high)
   return i
 }
 

diff --git a/Quicksort/README.markdown b/Quicksort/README.markdown
@@ -137,12 +137,12 @@ func partitionLomuto<T: Comparable>(_ a: inout [T], low: Int, high: Int) -> Int
   var i = low
   for j in low..<high {
     if a[j] <= pivot {
-      (a[i], a[j]) = (a[j], a[i])
+	  a.swapAt(i, j)
       i += 1
     }
   }
 
-  (a[i], a[high]) = (a[high], a[i])
+  a.swapAt(i, high)
   return i
 }
 ```