Simple bubble sort in Smalltalk.

CONTRIBUTORS.md

@@ -65,4 +65,4 @@ Trashtalk
 Cyrus Burt
 <br>
 Patrik Tesarik
-<br>
+<br>Neverik

contents/bubble_sort/bubble_sort.md

@@ -105,6 +105,8 @@ Trust me, there are plenty of more complicated algorithms that do precisely the
 [import, lang:"nim"](code/nim/bubble_sort.nim)
 {% sample lang="f90" %}
 [import, lang:"fortran"](code/fortran/bubble.f90)
+{% sample lang="st" %}
+[import, lang:"smalltalk"](code/smalltalk/bubble.st)
 {% endmethod %}
 
 <script>

contents/bubble_sort/code/smalltalk/bubble.st

@@ -0,0 +1,17 @@
+bubbleSort
+"Bubble sort for an array."
+
+| len swapper thisElem nextElem nextIndex |
+len := self size.
+1 to: len - 1 do: [ :iteration |
+1 to: len - 1 do: [ :thisIndex |
+thisElem := self at: thisIndex.
+nextIndex := thisIndex + 1.
+nextElem := self at: nextIndex.
+(thisElem > nextElem) ifTrue: [ 
+swapper := nextElem.
+self at: nextIndex put: thisElem.
+self at: thisIndex put: swapper.
+]
+]
+ ]