diff --git a/.editorconfig b/.editorconfig index 0faa1c175..d36f18254 100644 --- a/.editorconfig +++ b/.editorconfig @@ -145,6 +145,11 @@ indent_size = 2 indent_style = space indent_size = 4 +# Scratch (text code) +[contents/*/code/scratch/*.txt] +indent_style = space +indent_size = 4 + # Whitespace [*.ws] indent_style = space diff --git a/contents/bubble_sort/bubble_sort.md b/contents/bubble_sort/bubble_sort.md index 6781c3621..3a1bb7e9a 100644 --- a/contents/bubble_sort/bubble_sort.md +++ b/contents/bubble_sort/bubble_sort.md @@ -68,6 +68,10 @@ This means that we need to go through the vector $$\mathcal{O}(n^2)$$ times with [import:2-14, lang:"emojicode"](code/emojicode/bubble_sort.emojic) {% sample lang="bash" %} [import:2-21, lang:"bash"](code/bash/bubble_sort.bash) +{% sample lang="scratch" %} +

+ +

{% endmethod %} ... And that's it for the simplest bubble sort method. @@ -141,6 +145,8 @@ Trust me, there are plenty of more complicated algorithms that do precisely the [import, lang:"emojicode"](code/emojicode/bubble_sort.emojic) {% sample lang="bash" %} [import, lang:"bash"](code/bash/bubble_sort.bash) +{% sample lang="scratch" %} +The code snippet was taken from this [Scratch project](https://scratch.mit.edu/projects/316483792) {% endmethod %}