Data update

Task/Sorting-algorithms-Stooge-sort/11l/sorting-algorithms-stooge-sort.11l

@@ -1,4 +1,4 @@
-F stoogesort(&l, i, j) -> N
+F stoogesort(&l, i, j) -> Void
    I l[j] < l[i]
       swap(&l[i], &l[j])
    I j - i > 1

Task/Sorting-algorithms-Stooge-sort/EasyLang/sorting-algorithms-stooge-sort.easy

@@ -9,8 +9,6 @@ proc stsort left right . d[] .
       stsort left right - t d[]
    .
 .
-for i = 1 to 100
-   d[] &= randint 1000
-.
+d[] = [ 1 4 5 3 -6 3 7 10 -2 -5 ]
 stsort 1 len d[] d[]
 print d[]

Task/Sorting-algorithms-Stooge-sort/Yabasic/sorting-algorithms-stooge-sort.basic

@@ -0,0 +1,38 @@
+dim array(15)
+a = 0
+b = arraysize(array(),1)
+
+for i = a to b
+    array(i) = ran(1000)
+next i
+
+print "unsort ";
+for i = a to b
+	print array(i) using("####");
+	if i = b then print ""; else print ", "; : fi
+next i
+
+stoogeSort(array(), a, b)  // ordenar el array
+
+print "\n  sort ";
+for i = a to b
+    print array(i) using("####");
+    if i = b then print ""; else print ", "; : fi
+next i
+print
+end
+
+sub stoogeSort(array(), l, r)
+    if array(r) < array(l) then
+        temp = array(r)
+        array(r) = array(l)
+        array(l) = temp
+    fi
+
+    if r - l > 1 then
+        t = int((r - l +1) / 3)
+        stoogeSort(array(), l    , r - t)
+        stoogeSort(array(), l + t, r    )
+        stoogeSort(array(), l    , r - t)
+    fi
+end sub