Skip to content

Commit ebc4caf

Browse files
Gathrosleios
authored andcommitted
Small change to assembly code formating (#455)
* changing x86_64 in book.json * moving assembly code * small change to book.json * changing bubble_sort.md
1 parent da95ae7 commit ebc4caf

File tree

3 files changed

+5
-5
lines changed

3 files changed

+5
-5
lines changed

book.json

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -137,7 +137,7 @@
137137
"name": "Nim"
138138
},
139139
{
140-
"lang": "x64",
140+
"lang": "asm-x64",
141141
"name": "X86-64 Assembly"
142142
},
143143
{

contents/bubble_sort/bubble_sort.md

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -50,8 +50,8 @@ This means that we need to go through the vector $$\mathcal{O}(n^2)$$ times with
5050
[import:3-28, lang:"lisp"](code/lisp/bubble_sort.lisp)
5151
{% sample lang="nim" %}
5252
[import:5-9, lang:"nim"](code/nim/bubble_sort.nim)
53-
{% sample lang="x64" %}
54-
[import:44-110, lang:"x64"](code/x64/bubble_sort.s)
53+
{% sample lang="asm-x64" %}
54+
[import:44-110, lang:"asm-x64"](code/asm-x64/bubble_sort.s)
5555
{% sample lang="f90" %}
5656
[import:19-40, lang:"fortran"](code/fortran/bubble.f90)
5757
{% sample lang="scala" %}
@@ -113,8 +113,8 @@ Trust me, there are plenty of more complicated algorithms that do precisely the
113113
[import, lang:"lisp"](code/lisp/bubble_sort.lisp)
114114
{% sample lang="nim" %}
115115
[import, lang:"nim"](code/nim/bubble_sort.nim)
116-
{% sample lang="x64" %}
117-
[import, lang:"x64"](code/x64/bubble_sort.s)
116+
{% sample lang="asm-x64" %}
117+
[import, lang:"asm-x64"](code/asm-x64/bubble_sort.s)
118118
{% sample lang="f90" %}
119119
[import, lang:"fortran"](code/fortran/bubble.f90)
120120
{% sample lang="scala" %}

0 commit comments

Comments
 (0)