diff --git a/contents/bubble_sort/bubble_sort.md b/contents/bubble_sort/bubble_sort.md
index 8b5b6b8e8..27071de4a 100644
--- a/contents/bubble_sort/bubble_sort.md
+++ b/contents/bubble_sort/bubble_sort.md
@@ -78,6 +78,8 @@ This means that we need to go through the vector $$\mathcal{O}(n^2)$$ times with
 [import:1-6, lang:"coffeescript"](code/coffeescript/bubblesort.coffee)
 {% sample lang="r" %}
 [import:1-12, lang:"r"](code/r/bubble_sort.R)
+{% sample lang="coco" %}
+[import:3-10, lang:"coconut"](code/coconut/bubblesort.coco)
 {% endmethod %}
 
 ... And that's it for the simplest bubble sort method.
@@ -159,6 +161,8 @@ The code snippet was taken from this [Scratch project](https://scratch.mit.edu/p
 [import, lang:"coffeescript"](code/coffeescript/bubblesort.coffee)
 {% sample lang="r" %}
 [import, lang:"r"](code/r/bubble_sort.R)
+{% sample lang="coco" %}
+[import, lang:"coconut"](code/coconut/bubblesort.coco)
 {% endmethod %}
 
 <script>
diff --git a/contents/bubble_sort/code/coconut/bubblesort.coco b/contents/bubble_sort/code/coconut/bubblesort.coco
new file mode 100644
index 000000000..7bafe1d73
--- /dev/null
+++ b/contents/bubble_sort/code/coconut/bubblesort.coco
@@ -0,0 +1,16 @@
+import random
+
+def swap_till(x, []) = [x]
+
+addpattern def swap_till(x, y is int) = [min(x, y), max(x, y)]
+
+addpattern def swap_till(x, [y] + rest) =
+    [min(x, y)] + swap_till(max(x, y), rest)
+
+bubble_sort = reduce$((x, y) -> swap_till(y, x))
+
+if __name__ == '__main__':
+    array = range(10) |> map$(-> random.randint(0, 1000)) |> list
+    print('Before sorting:', array)
+    array = bubble_sort(array) |> list
+    print('After sorting:', array)