From 0d697f26e7714663772425619a6f39d270926e53 Mon Sep 17 00:00:00 2001
From: binarydinosaur252 <cyrusb252@gmail.com>
Date: Tue, 21 Aug 2018 21:00:20 -0400
Subject: [PATCH 1/5] implemented bubble sort in nim

---
 contents/bubble_sort/bubble_sort.md           |  4 ++++
 contents/bubble_sort/code/nim/bubble_sort.nim | 14 ++++++++++++++
 2 files changed, 18 insertions(+)
 create mode 100644 contents/bubble_sort/code/nim/bubble_sort.nim

diff --git a/contents/bubble_sort/bubble_sort.md b/contents/bubble_sort/bubble_sort.md
index fbdd88060..3354d1e9e 100644
--- a/contents/bubble_sort/bubble_sort.md
+++ b/contents/bubble_sort/bubble_sort.md
@@ -46,6 +46,8 @@ This means that we need to go through the vector $$\mathcal{O}(n^2)$$ times with
 [import:3-15, lang:"php"](code/php/bubble_sort.php)
 {% sample lang="lisp" %}
 [import:3-28, lang:"lisp"](code/lisp/bubble_sort.lisp)
+{% sample lang="nim" %}
+[import:6-10, lang:"nim"](code/nim/bubble_sort.nim)
 {% endmethod %}
 
 ... And that's it for the simplest bubble sort method.
@@ -97,6 +99,8 @@ Trust me, there are plenty of more complicated algorithms that do precisely the
 [import, lang:"php"](code/php/bubble_sort.php)
 {% sample lang="lisp" %}
 [import, lang:"lisp"](code/lisp/bubble_sort.lisp)
+{% sample lang="nim" %}
+[import, lang:"nim"](code/nim/bubble_sort.nim)
 {% endmethod %}
 
 <script>
diff --git a/contents/bubble_sort/code/nim/bubble_sort.nim b/contents/bubble_sort/code/nim/bubble_sort.nim
new file mode 100644
index 000000000..eef58563a
--- /dev/null
+++ b/contents/bubble_sort/code/nim/bubble_sort.nim
@@ -0,0 +1,14 @@
+
+proc print_array(a: openArray[int]) =
+    for n in 0 .. len(a)-1:
+        echo a[n]
+
+proc bubble_sort(a: var openArray[int]) =
+    for i in 0 .. < len(a):
+        for j in 0 .. < (len(a) - 1):
+            if a[j+1] > a[j]:
+                swap(a[j],a[j+1])
+
+var x: array[10,int] =  [32,32,64,16,128,8,256,4,512,2]
+bubble_sort(x)
+print_array(x)
\ No newline at end of file

From 3b388e18a5504f6a851c874390443b50d25ed114 Mon Sep 17 00:00:00 2001
From: Cyrus B <cyrusb252@gmail.com>
Date: Wed, 22 Aug 2018 06:56:12 -0400
Subject: [PATCH 2/5] fixed formatting problems

---
 contents/bubble_sort/code/nim/bubble_sort.nim | 8 +++++---
 1 file changed, 5 insertions(+), 3 deletions(-)

diff --git a/contents/bubble_sort/code/nim/bubble_sort.nim b/contents/bubble_sort/code/nim/bubble_sort.nim
index eef58563a..d74c2b9ec 100644
--- a/contents/bubble_sort/code/nim/bubble_sort.nim
+++ b/contents/bubble_sort/code/nim/bubble_sort.nim
@@ -1,14 +1,16 @@
-
 proc print_array(a: openArray[int]) =
     for n in 0 .. len(a)-1:
         echo a[n]
 
 proc bubble_sort(a: var openArray[int]) =
-    for i in 0 .. < len(a):
+    for i in 0 .. len(a):
         for j in 0 .. < (len(a) - 1):
             if a[j+1] > a[j]:
                 swap(a[j],a[j+1])
 
 var x: array[10,int] =  [32,32,64,16,128,8,256,4,512,2]
+
+print_array(x)
+echo "\n"
 bubble_sort(x)
-print_array(x)
\ No newline at end of file
+print_array(x)

From 17882792e79ebdf2b4dab0452f2418f7ac4e1753 Mon Sep 17 00:00:00 2001
From: Cyrus B <cyrusb252@gmail.com>
Date: Wed, 22 Aug 2018 20:02:23 -0400
Subject: [PATCH 3/5] fixed loop issues

---
 contents/bubble_sort/code/nim/bubble_sort.nim | 5 ++---
 1 file changed, 2 insertions(+), 3 deletions(-)

diff --git a/contents/bubble_sort/code/nim/bubble_sort.nim b/contents/bubble_sort/code/nim/bubble_sort.nim
index d74c2b9ec..b34b95cf7 100644
--- a/contents/bubble_sort/code/nim/bubble_sort.nim
+++ b/contents/bubble_sort/code/nim/bubble_sort.nim
@@ -1,15 +1,14 @@
 proc print_array(a: openArray[int]) =
-    for n in 0 .. len(a)-1:
+    for n in 0 .. < len(a):
         echo a[n]
 
 proc bubble_sort(a: var openArray[int]) =
-    for i in 0 .. len(a):
+    for i in 0 .. < len(a):
         for j in 0 .. < (len(a) - 1):
             if a[j+1] > a[j]:
                 swap(a[j],a[j+1])
 
 var x: array[10,int] =  [32,32,64,16,128,8,256,4,512,2]
-
 print_array(x)
 echo "\n"
 bubble_sort(x)

From c7dcd50bab8b3ef97f77aa4edf561533ff25ca56 Mon Sep 17 00:00:00 2001
From: Cyrus B <cyrusb252@gmail.com>
Date: Wed, 22 Aug 2018 20:16:54 -0400
Subject: [PATCH 4/5] Update bubble_sort.nim

---
 contents/bubble_sort/code/nim/bubble_sort.nim | 9 +++++----
 1 file changed, 5 insertions(+), 4 deletions(-)

diff --git a/contents/bubble_sort/code/nim/bubble_sort.nim b/contents/bubble_sort/code/nim/bubble_sort.nim
index b34b95cf7..d106b5474 100644
--- a/contents/bubble_sort/code/nim/bubble_sort.nim
+++ b/contents/bubble_sort/code/nim/bubble_sort.nim
@@ -3,13 +3,14 @@ proc print_array(a: openArray[int]) =
         echo a[n]
 
 proc bubble_sort(a: var openArray[int]) =
-    for i in 0 .. < len(a):
-        for j in 0 .. < (len(a) - 1):
-            if a[j+1] > a[j]:
+    for i in 0 .. < len(a) - 1:
+        for j in 0 .. < len(a) - 1:
+            if a[j+1] < a[j]:
                 swap(a[j],a[j+1])
 
 var x: array[10,int] =  [32,32,64,16,128,8,256,4,512,2]
+echo "Unsorted:"
 print_array(x)
-echo "\n"
+echo "\nSorted:"
 bubble_sort(x)
 print_array(x)

From cdfe7429da70670742cdd95d97707113ea5a131b Mon Sep 17 00:00:00 2001
From: Cyrus B <cyrusb252@gmail.com>
Date: Wed, 22 Aug 2018 20:28:09 -0400
Subject: [PATCH 5/5] Update bubble_sort.md

---
 contents/bubble_sort/bubble_sort.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/contents/bubble_sort/bubble_sort.md b/contents/bubble_sort/bubble_sort.md
index 3354d1e9e..31ef68f69 100644
--- a/contents/bubble_sort/bubble_sort.md
+++ b/contents/bubble_sort/bubble_sort.md
@@ -47,7 +47,7 @@ This means that we need to go through the vector $$\mathcal{O}(n^2)$$ times with
 {% sample lang="lisp" %}
 [import:3-28, lang:"lisp"](code/lisp/bubble_sort.lisp)
 {% sample lang="nim" %}
-[import:6-10, lang:"nim"](code/nim/bubble_sort.nim)
+[import:5-9, lang:"nim"](code/nim/bubble_sort.nim)
 {% endmethod %}
 
 ... And that's it for the simplest bubble sort method.