correction in the algorithm

Author: JulioBBL

Bubble Sort/MyPlayground.playground/Contents.swift

@@ -4,10 +4,11 @@ public func BubbleSort<T> (_ elements: [T]) -> [T] where T: Comparable {
     var array = elements
 
     for i in 0..<array.count {
-        for j in i+1..<array.count {
-            if array[j] < array[i] {
-                let tmp = array[i]
-                array[i] = array[j]
+        for j in 1..<array.count-i {
+            print(array,"comparing [\(j-1)] with [\(j)]")
+            if array[j] < array[j-1] {
+                let tmp = array[j-1]
+                array[j-1] = array[j]
                 array[j] = tmp
             }
         }
@@ -16,12 +17,7 @@ public func BubbleSort<T> (_ elements: [T]) -> [T] where T: Comparable {
     return array
 }
 
-
-var array = [Int]()
-
-for _ in 0...10 {
-    array.append(Int.random(in: 0...500))
-}
+var array = [4,2,1,3]
 
 print("before:",array)
 print("after:",BubbleSort(array))

Bubble Sort/MyPlayground.playground/Sources/BubbleSort.swift

@@ -29,10 +29,10 @@ public func BubbleSort<T> (_ elements: [T]) -> [T] where T: Comparable {
     var array = elements
 
     for i in 0..<array.count {
-        for j in i+1..<array.count {
-            if array[j] < array[i] {
-                let tmp = array[i]
-                array[i] = array[j]
+        for j in 1..<array.count-i {
+            if array[j] < array[j-1] {
+                let tmp = array[j-1]
+                array[j-1] = array[j]
                 array[j] = tmp
             }
         }