bubblesort in v (algorithm-archivists#631)

Author: Julian

contents/bubble_sort/bubble_sort.md

@@ -68,6 +68,8 @@ 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="v" %}
+[import:1-11, lang:"v"](code/v/bubble_sort.v)
 {% sample lang="scratch" %}
 <p>
   <img  class="center" src="code/scratch/bubble_sort.svg" width="400" />
@@ -147,6 +149,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="v" %}
+[import, lang:"v"](code/v/bubble_sort.v)
 {% sample lang="scratch" %}
 The code snippet was taken from this [Scratch project](https://scratch.mit.edu/projects/316483792)
 {% sample lang="coffeescript" %}

contents/bubble_sort/code/v/bubble_sort.v

@@ -0,0 +1,20 @@
+fn bubblesort(arr mut []int) {
+	for i := 0; i < arr.len-1; i++ {
+		for j := 0; j < arr.len-i-1; j++ {
+			if arr[j] > arr[j+1] {
+				tmp := arr[j]
+				arr[j] = arr[j+1]
+				arr[j+1] = tmp
+			}
+		}
+	}
+}
+
+fn main() {
+	mut arr := [1, 45, 756, 4569, 56, 3, 8, 5, -10, -4]
+	println('Array unsorted:')
+	println(arr)
+	bubblesort(mut arr)
+	println('Array sorted:')
+	println(arr)
+}