Data update

Task/Sorting-algorithms-Stooge-sort/Julia/sorting-algorithms-stooge-sort.jl

@@ -4,7 +4,7 @@ function stoogesort!(a::Array, i::Int=1, j::Int=length(a))
     end
 
     if (j - i) > 1
-        t = round(Int, (j - i + 1) / 3)
+        t = (j - i + 1) ÷ 3
         a = stoogesort!(a, i,     j - t)
         a = stoogesort!(a, i + t, j)
         a = stoogesort!(a, i,     j - t)

Task/Sorting-algorithms-Stooge-sort/Maxima/sorting-algorithms-stooge-sort.maxima

@@ -0,0 +1,14 @@
+stoogesort(list, i, j) := block(
+if(list[j]<list[i]) then block(a: list[j], b: list[i], list[i]: a, list[j]:b),
+if(j-i>1) then block(
+    t: floor((j-i+1)/3),
+    stoogesort(list, i, j-t),
+    stoogesort(list, i+t, j),
+    stoogesort(list, i, j-t)),
+list)$
+
+test_list: makelist(random(21),20);
+
+stooge(list) := stoogesort(list, 1, length(list))$
+
+stooge(test_list);

Task/Sorting-algorithms-Stooge-sort/R/sorting-algorithms-stooge-sort.r

@@ -1,17 +1,15 @@
 stoogesort = function(vect) {
-	i = 1
-	j = length(vect)
-	if(vect[j] < vect[i])  vect[c(j, i)] = vect[c(i, j)]
+	i <- 1
+	j <- length(vect)
+	if(vect[j] < vect[i])  vect[c(j, i)] <- vect[c(i, j)]
 	if(j - i > 1) {
-		t = (j - i + 1) %/% 3
-		vect[i:(j - t)] = stoogesort(vect[i:(j - t)])
-		vect[(i + t):j] = stoogesort(vect[(i + t):j])
-		vect[i:(j - t)] = stoogesort(vect[i:(j - t)])
+		t <- (j - i + 1) %/% 3
+		vect[i:(j - t)] <- stoogesort(vect[i:(j - t)])
+		vect[(i + t):j] <- stoogesort(vect[(i + t):j])
+		vect[i:(j - t)] <- stoogesort(vect[i:(j - t)])
 	}
 	vect
 }
 
-v = sample(21, 20)
-k = stoogesort(v)
-v
-k
+v <- print(sample(21, 20))
+stoogesort(v)