diff --git a/contents/bubble_sort/bubble_sort.md b/contents/bubble_sort/bubble_sort.md
index fbdd88060..31ef68f69 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:5-9, 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..d106b5474
--- /dev/null
+++ b/contents/bubble_sort/code/nim/bubble_sort.nim
@@ -0,0 +1,16 @@
+proc print_array(a: openArray[int]) =
+    for n in 0 .. < len(a):
+        echo a[n]
+
+proc bubble_sort(a: var openArray[int]) =
+    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 "\nSorted:"
+bubble_sort(x)
+print_array(x)