Merge pull request kodecocodes#845 from gmotzespina/master

Solved - Bubble Sort Readme Code Issue kodecocodes#838

Author: kelvinlauKL

Bubble Sort/README.markdown

@@ -57,9 +57,9 @@ This is the same for the forth and fifth passes.
 ```swift
 for i in 0..<array.count {
   for j in 1..<array.count {
-    if array[j] < array[i] {
-      let tmp = array[i]
-      array[i] = array[j]
+    if array[j] < array[j-1] {
+      let tmp = array[j-1]
+      array[j-1] = array[j]
       array[j] = tmp
     }
   }
@@ -73,9 +73,9 @@ The bubble sort algorithm can be easily optimized by observing that the `n-th` p
 ```swift
 for i in 0..<array.count {
   for j in 1..<array.count - i {
-    if array[j] < array[i] {
-      let tmp = array[i]
-      array[i] = array[j]
+    if array[j] < array[j-1] {
+      let tmp = array[j-1]
+      array[j-1] = array[j]
       array[j] = tmp
     }
   }