From 6dc91c4a7bee34ff2b4fe9f4f2d5d77d3d42e55c Mon Sep 17 00:00:00 2001
From: Abuzeid-Ibrahim <abuzeid7@gmail.com>
Date: Thu, 15 Aug 2019 14:35:33 +0200
Subject: [PATCH] Update README.markdown

---
 Insertion Sort/README.markdown | 32 ++++++++++++++++----------------
 1 file changed, 16 insertions(+), 16 deletions(-)

diff --git a/Insertion Sort/README.markdown b/Insertion Sort/README.markdown
index 4bad29aa1..8c2a5c1a0 100644
--- a/Insertion Sort/README.markdown	
+++ b/Insertion Sort/README.markdown	
@@ -91,15 +91,15 @@ Here is an implementation of insertion sort in Swift:
 
 ```swift
 func insertionSort(_ array: [Int]) -> [Int] {
-    var a = array			 // 1
-    for x in 1..<a.count {		 // 2
-        var y = x
-        while y > 0 && a[y] < a[y - 1] { // 3
-            a.swapAt(y - 1, y)
-            y -= 1
+    var sortedArray = array			 // 1
+    for index in 1..<sortedArray.count {		 // 2
+        var currentIndex = index
+        while currentIndex > 0 && sortedArray[currentIndex] < sortedArray[currentIndex - 1] { // 3
+            sortedArray.swapAt(currentIndex - 1, currentIndex)
+            currentIndex -= 1
         }
     }
-    return a
+    return sortedArray
 }
 
 
@@ -154,17 +154,17 @@ In code that looks like this:
 
 ```swift
 func insertionSort(_ array: [Int]) -> [Int] {
-  var a = array
-  for x in 1..<a.count {
-    var y = x
-    let temp = a[y]
-    while y > 0 && temp < a[y - 1] {
-      a[y] = a[y - 1]                // 1
-      y -= 1
+  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]                // 1
+      currentIndex -= 1
     }
-    a[y] = temp                      // 2
+    sortedArray[currentIndex] = temp                      // 2
   }
-  return a
+  return sortedArray
 }
 ```