diff --git a/Bloom Filter/BloomFilter.playground/Contents.swift b/Bloom Filter/BloomFilter.playground/Contents.swift
index 7a3719d57..8ed808a06 100644
--- a/Bloom Filter/BloomFilter.playground/Contents.swift	
+++ b/Bloom Filter/BloomFilter.playground/Contents.swift	
@@ -79,4 +79,4 @@ bloom.insert("Bloom Filterz")
 print(bloom.array)
 
 bloom.query("Bloom Filterz")   // true
-bloom.query("Hello WORLD")     // true
+bloom.query("Hello WORLD")     // false or true: It may return true due to a false positive, but it's not guaranteed.
diff --git a/Insertion Sort/InsertionSort.swift b/Insertion Sort/InsertionSort.swift
index e24ede905..5f0b6c2b4 100644
--- a/Insertion Sort/InsertionSort.swift	
+++ b/Insertion Sort/InsertionSort.swift	
@@ -28,14 +28,13 @@ func insertionSort<T: Comparable>(_ array: [T]) -> [T] {
     guard array.count > 1 else { return array }
 
     var sortedArray = array
-    for index in 1..<sortedArray.count {
-        var currentIndex = index
-        let temp = sortedArray[currentIndex]
-        while currentIndex > 0, temp < sortedArray[currentIndex - 1] {
-            sortedArray[currentIndex] = sortedArray[currentIndex - 1]
-            currentIndex -= 1
+    for var index in 1..<sortedArray.count {
+        let temp = sortedArray[index]
+        while index > 0, temp < sortedArray[index - 1] {
+            sortedArray[index] = sortedArray[index - 1]
+            index -= 1
         }
-        sortedArray[currentIndex] = temp
+        sortedArray[index] = temp
     }
     return sortedArray
 }
diff --git a/Insertion Sort/README.markdown b/Insertion Sort/README.markdown
index 8c2a5c1a0..f7b933b92 100644
--- a/Insertion Sort/README.markdown	
+++ b/Insertion Sort/README.markdown	
@@ -114,11 +114,11 @@ insertionSort(list)
 
 Here is how the code works.
 
-1. Make a copy of the array. This is necessary because we cannot modify the contents of the `array` parameter directly. Like Swift's own `sort()`, the `insertionSort()` function will return a sorted *copy* of the original array.
+1. Make a copy of the array. This is necessary because we cannot modify the contents of the `array` parameter directly. Like Swift's own `sorted()`, the `insertionSort()` function will return a sorted *copy* of the original array.
 
-2. There are two loops inside this function. The outer loop looks at each of the elements in the array in turn; this is what picks the top-most number from the pile. The variable `x` is the index of where the sorted portion ends and the pile begins (the position of the `|` bar). Remember, at any given moment the beginning of the array -- from index 0 up to `x` -- is always sorted. The rest, from index `x` until the last element, is the unsorted pile.
+2. There are two loops inside this function. The outer loop looks at each of the elements in the array in turn; this is what picks the top-most number from the pile. The variable `currentIndex` is the index of where the sorted portion ends and the pile begins (the position of the `|` bar). Remember, at any given moment the beginning of the array -- from index 0 up to `currentIndex` -- is always sorted. The rest, from index `currentIndex` until the last element, is the unsorted pile.
 
-3. The inner loop looks at the element at position `x`. This is the number at the top of the pile, and it may be smaller than any of the previous elements. The inner loop steps backwards through the sorted array; every time it finds a previous number that is larger, it swaps them. When the inner loop completes, the beginning of the array is sorted again, and the sorted portion has grown by one element.
+3. The inner loop looks at the element at position `currentIndex`. This is the number at the top of the pile, and it may be smaller than any of the previous elements. The inner loop steps backwards through the sorted array; every time it finds a previous number that is larger, it swaps them. When the inner loop completes, the beginning of the array is sorted again, and the sorted portion has grown by one element.
 
 > **Note:** The outer loop starts at index 1, not 0. Moving the very first element from the pile to the sorted portion doesn't actually change anything, so we might as well skip it. 
 
diff --git a/Selection Sampling/README.markdown b/Selection Sampling/README.markdown
index 741f592f4..5c2ff5e25 100644
--- a/Selection Sampling/README.markdown	
+++ b/Selection Sampling/README.markdown	
@@ -12,7 +12,7 @@ func select<T>(from a: [T], count k: Int) -> [T] {
   for i in 0..<k {
     let r = random(min: i, max: a.count - 1)
     if i != r {
-      swap(&a[i], &a[r])
+      a.swapAt(i, r) // Corrected line in README
     }
   }
   return Array(a[0..<k])
diff --git a/Selection Sampling/SelectionSampling.swift b/Selection Sampling/SelectionSampling.swift
index 52aa5988b..711460f47 100644
--- a/Selection Sampling/SelectionSampling.swift	
+++ b/Selection Sampling/SelectionSampling.swift	
@@ -17,7 +17,7 @@ func select<T>(from a: [T], count k: Int) -> [T] {
   for i in 0..<k {
     let r = random(min: i, max: a.count - 1)
     if i != r {
-      swap(&a[i], &a[r])
+      a.swapAt(i, r) // Corrected line
     }
   }
   return Array(a[0..<k])