From 83a2606806c1e01baba16f1d76e7d636680494e5 Mon Sep 17 00:00:00 2001
From: Gathros <6323830+Gathros@users.noreply.github.com>
Date: Sat, 20 Oct 2018 18:25:29 +0100
Subject: [PATCH 1/3] fixing small error in bogo_sort.md

---
 contents/bogo_sort/bogo_sort.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/contents/bogo_sort/bogo_sort.md b/contents/bogo_sort/bogo_sort.md
index 4704f9fb4..e0f59dcc9 100644
--- a/contents/bogo_sort/bogo_sort.md
+++ b/contents/bogo_sort/bogo_sort.md
@@ -56,7 +56,7 @@ In code, it looks something like this:
 {% sample lang="st" %}
 [import:2-6, lang:"st"](code/smalltalk/bogosort.st)
 {% sample lang="asm-x64" %}
-[import:93-113, lang:"asm-x64"](code/asm-x64/bogosort.s)
+[import:93-113, lang:"asm-x64"](code/asm-x64/bogo_sort.s)
 {% sample lang="lisp" %}
 [import:20-24, lang:"lisp"](code/lisp/bogo-sort.lisp)
 {% endmethod %}
@@ -114,7 +114,7 @@ We are done here!
 {% sample lang="st" %}
 [import, lang:"st"](code/smalltalk/bogosort.st)
 {% sample lang="asm-x64" %}
-[import, lang:"asm-x64"](code/asm-x64/bogosort.s)
+[import, lang:"asm-x64"](code/asm-x64/bogo_sort.s)
 {% sample lang="lisp" %}
 [import, lang:"lisp"](code/lisp/bogo-sort.lisp)
 {% endmethod %}

From ef57642948d52d5b13a3624494459626d34ae9e6 Mon Sep 17 00:00:00 2001
From: Gathros <6323830+Gathros@users.noreply.github.com>
Date: Sat, 20 Oct 2018 18:27:41 +0100
Subject: [PATCH 2/3] fixing 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 8fa02a786..07ffec4bd 100644
--- a/contents/bubble_sort/bubble_sort.md
+++ b/contents/bubble_sort/bubble_sort.md
@@ -55,7 +55,7 @@ This means that we need to go through the vector $$\mathcal{O}(n^2)$$ times with
 {% sample lang="st" %}
 [import:2-15, lang:"smalltalk"](code/smalltalk/bubble.st)
 {% sample lang="asm-x64" %}
-[import:44-110, lang:"asm-x64"](code/asm-x64/bubble_sort.s)
+[import:43-66, lang:"asm-x64"](code/asm-x64/bubble_sort.s)
 {% sample lang="f90" %}
 [import:19-40, lang:"fortran"](code/fortran/bubble.f90)
 {% sample lang="bf" %}

From c03476e21f35559db46b9a99e25510b7251802c4 Mon Sep 17 00:00:00 2001
From: Gathros <6323830+Gathros@users.noreply.github.com>
Date: Sat, 20 Oct 2018 18:30:44 +0100
Subject: [PATCH 3/3] fixing euclidean_algorithm.md

---
 contents/euclidean_algorithm/euclidean_algorithm.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/contents/euclidean_algorithm/euclidean_algorithm.md b/contents/euclidean_algorithm/euclidean_algorithm.md
index ff05c7af9..b2dffc0c2 100644
--- a/contents/euclidean_algorithm/euclidean_algorithm.md
+++ b/contents/euclidean_algorithm/euclidean_algorithm.md
@@ -40,7 +40,7 @@ The algorithm is a simple way to find the *greatest common divisor* (GCD) of two
 {% sample lang="nim" %}
 [import:13-24, lang="nim"](code/nim/euclid_algorithm.nim)
 {% sample lang="asm-x64" %}
-[import:43-78, lang="asm-x64"](code/asm-x64/euclidean_example.s)
+[import:35-56, lang="asm-x64"](code/asm-x64/euclidean_example.s)
 {% sample lang="f90" %}
 [import:1-19, lang="fortran"](code/fortran/euclidean.f90)
 {% sample lang="php" %}
@@ -109,7 +109,7 @@ Modern implementations, though, often use the modulus operator (%) like so
 {% sample lang="nim" %}
 [import:1-11, lang="nim"](code/nim/euclid_algorithm.nim)
 {% sample lang="asm-x64" %}
-[import:8-41, lang="asm-x64"](code/asm-x64/euclidean_example.s)
+[import:10-33, lang="asm-x64"](code/asm-x64/euclidean_example.s)
 {% sample lang="f90" %}
 [import:21-34, lang="fortran"](code/fortran/euclidean.f90)
 {% sample lang="php" %}