Improved the JS implementation for Bubble Sort

Author: Butt4cak3

contents/bubble_sort/bubble_sort.md

@@ -19,7 +19,7 @@ This means that we need to go through the vector $$\mathcal{O}(n^2)$$ times with
 {% sample lang="kotlin" %}
 [import:1-11, lang:"kotlin"](code/kotlin/BubbleSort.kt)
 {% sample lang="js" %}
-[import:1-11, lang:"javascript"](code/javascript/bubble.js)
+[import:1-12, lang:"javascript"](code/javascript/bubble.js)
 {% sample lang="py" %}
 [import:4-9, lang:"python"](code/python/bubblesort.py)
 {% sample lang="m" %}

contents/bubble_sort/code/javascript/bubble.js

@@ -1,17 +1,18 @@
 function bubbleSort(arr) {
-  for (let r = arr.length -1; r > 0; r--) {
-    for (let i = 0; i < r; i++) {
-      if (arr[i] > arr[i + 1]) {
-        let tmp = arr[i];
-        arr[i] = arr[i + 1];
-        arr[i + 1] = tmp;
+  let tmp;
+  for (let i = 0; i < arr.length; i++) {
+    for (let k = 0; k < arr.length - 1; k++) {
+      if (arr[k] > arr[k + 1]) {
+        tmp = arr[k];
+        arr[k] = arr[k + 1];
+        arr[k + 1] = tmp;
       }
     }
   }
 }
 
 function main() {
-  const testArray = [4, 5, 123, 759, -132, 8940, 24, 34, -5];
+  const testArray = [1, 3, 2, 4, 5, 10, 50, 7, 1.5, 0.3];
   bubbleSort(testArray);
   console.log(testArray);
 }