Data update

Task/Sorting-algorithms-Bubble-sort/Befunge/sorting-algorithms-bubble-sort.bf

@@ -0,0 +1,7 @@
+000p&:   v                    >20g:7g\1+7g2v
+v00p7g00 _10p0>20p20g:7g\1+7g`|0p7+1g02p7g0<
+>g1+00p&:^    |-\g00:+1g02    <
+         0    >$10gv
+         |-\g00:+1 <
+         >1->:7g\:#v_$>:#._25*,@
+         ^         <

Task/Sorting-algorithms-Bubble-sort/Elena/sorting-algorithms-bubble-sort.elena

@@ -13,7 +13,7 @@ extension op
         {
             madeChanges := false;
             itemCount -= 1;
-            for(int i := 0, i < itemCount, i += 1)
+            for(int i := 0; i < itemCount; i += 1)
             {
                 if (list[i] > list[i + 1])
                 {

Task/Sorting-algorithms-Bubble-sort/GDScript/sorting-algorithms-bubble-sort-1.gd

@@ -0,0 +1,29 @@
+extends Node2D
+
+
+func BubbleSort(_array : Array) -> void:
+    for i in range(_array.size() - 1):
+        var swapped : bool = false
+        for j in range(_array.size() - i - 1):
+            if _array[j] > _array[j + 1]:
+                var tmp = _array[j]
+                _array[j] = _array[j + 1]
+                _array[j + 1] = tmp
+                swapped = true
+        if not swapped:
+            break
+    return
+
+
+func _ready() -> void:
+    var array : Array = range(-10, 10)
+    array.shuffle()
+
+    print("Initial array:")
+    print(array)
+
+    BubbleSort(array)
+
+    print("Sorted array:")
+    print(array)
+    return

Task/Sorting-algorithms-Bubble-sort/GDScript/sorting-algorithms-bubble-sort-2.gd

@@ -0,0 +1,24 @@
+class Comparable:
+    var Value
+
+    func _init(_val):
+        self.Value = _val
+
+    func compare(_other : Comparable) -> int:
+        # Here is the simple implementation of compare
+        # for primitive type wrapper.
+        return self.Value - _other.Value
+
+
+func BubbleSortObjects(_array : Array) -> void:
+    for i in range(_array.size() - 1):
+        var swapped : bool = false
+        for j in range(_array.size() - i - 1):
+            if _array[j].compare(_array[j + 1]) > 0:
+                var tmp = _array[j]
+                _array[j] = _array[j + 1]
+                _array[j + 1] = tmp
+                swapped = true
+        if not swapped:
+            break
+    return

Task/Sorting-algorithms-Bubble-sort/Wren/sorting-algorithms-bubble-sort.wren

@@ -15,8 +15,8 @@ var bubbleSort = Fn.new { |a|
     }
 }
 
-var as = [ [4, 65, 2, -31, 0, 99, 2, 83, 782, 1], [7, 5, 2, 6, 1, 4, 2, 6, 3] ]
-for (a in as) {
+var array = [ [4, 65, 2, -31, 0, 99, 2, 83, 782, 1], [7, 5, 2, 6, 1, 4, 2, 6, 3] ]
+for (a in array) {
     System.print("Before: %(a)")
     bubbleSort.call(a)
     System.print("After : %(a)")