Data update

Task/Sorting-algorithms-Bogosort/Ada/sorting-algorithms-bogosort.adb

@@ -0,0 +1,50 @@
+with Ada.Text_IO;  use Ada.Text_IO;
+with Ada.Numerics.Discrete_Random;
+
+procedure Test_Bogosort is
+   generic
+      type Ordered is private;
+      type List is array (Positive range <>) of Ordered;
+      with function "<" (L, R : Ordered) return Boolean is <>;
+   procedure Bogosort (Data : in out List);
+
+   procedure Bogosort (Data : in out List) is
+      function Sorted return Boolean is
+      begin
+         for I in Data'First..Data'Last - 1 loop
+            if not (Data (I) < Data (I + 1)) then
+               return False;
+            end if;
+         end loop;
+         return True;
+      end Sorted;
+      subtype Index is Integer range Data'Range;
+      package Dices is new Ada.Numerics.Discrete_Random (Index);
+      use Dices;
+      Dice : Generator;
+      procedure Shuffle is
+         J    : Index;
+         Temp : Ordered;
+      begin
+         for I in Data'Range loop
+            J := Random (Dice);
+            Temp := Data (I);
+            Data (I) := Data (J);
+            Data (J) := Temp;
+         end loop;
+      end Shuffle;
+   begin
+      while not Sorted loop
+         Shuffle;
+      end loop;
+   end Bogosort;
+
+   type List is array (Positive range <>) of Integer;
+   procedure Integer_Bogosort is new Bogosort (Integer, List);
+   Sequence : List := (7,6,3,9);
+begin
+   Integer_Bogosort (Sequence);
+   for I in Sequence'Range loop
+      Put (Integer'Image (Sequence (I)));
+   end loop;
+end Test_Bogosort;

Task/Sorting-algorithms-Bogosort/COBOL/sorting-algorithms-bogosort.cob

@@ -0,0 +1,65 @@
+identification division.
+program-id. bogo-sort-program.
+data division.
+working-storage section.
+01  array-to-sort.
+    05 item-table.
+        10 item          pic 999
+            occurs 10 times.
+01  randomization.
+    05 random-seed       pic 9(8).
+    05 random-index      pic 9.
+01  flags-counters-etc.
+    05 array-index       pic 99.
+    05 adjusted-index    pic 99.
+    05 temporary-storage pic 999.
+    05 shuffles          pic 9(8)
+        value zero.
+    05 sorted            pic 9.
+01  numbers-without-leading-zeros.
+    05 item-no-zeros     pic z(4).
+    05 shuffles-no-zeros pic z(8).
+procedure division.
+control-paragraph.
+    accept random-seed from time.
+    move function random(random-seed) to item(1).
+    perform random-item-paragraph varying array-index from 2 by 1
+    until array-index is greater than 10.
+    display 'BEFORE SORT:' with no advancing.
+    perform show-array-paragraph varying array-index from 1 by 1
+    until array-index is greater than 10.
+    display ''.
+    perform shuffle-paragraph through is-it-sorted-paragraph
+    until sorted is equal to 1.
+    display 'AFTER SORT: ' with no advancing.
+    perform show-array-paragraph varying array-index from 1 by 1
+    until array-index is greater than 10.
+    display ''.
+    move shuffles to shuffles-no-zeros.
+    display shuffles-no-zeros ' SHUFFLES PERFORMED.'
+    stop run.
+random-item-paragraph.
+    move function random to item(array-index).
+show-array-paragraph.
+    move item(array-index) to item-no-zeros.
+    display item-no-zeros with no advancing.
+shuffle-paragraph.
+    perform shuffle-items-paragraph,
+    varying array-index from 1 by 1
+    until array-index is greater than 10.
+    add 1 to shuffles.
+is-it-sorted-paragraph.
+    move 1 to sorted.
+    perform item-in-order-paragraph varying array-index from 1 by 1,
+    until sorted is equal to zero
+    or array-index is equal to 10.
+shuffle-items-paragraph.
+    move function random to random-index.
+    add 1 to random-index giving adjusted-index.
+    move item(array-index) to temporary-storage.
+    move item(adjusted-index) to item(array-index).
+    move temporary-storage to item(adjusted-index).
+item-in-order-paragraph.
+    add 1 to array-index giving adjusted-index.
+    if item(array-index) is greater than item(adjusted-index)
+    then move zero to sorted.

Task/Sorting-algorithms-Bogosort/EasyLang/sorting-algorithms-bogosort.easy

@@ -1,6 +1,6 @@
 proc shuffle &l[] .
    for i = len l[] downto 2
-      r = random i
+      r = random 1 i
       swap l[i] l[r]
    .
 .

Task/Sorting-algorithms-Bogosort/Euphoria/sorting-algorithms-bogosort.eu

@@ -0,0 +1,32 @@
+function shuffle(sequence s)
+    object temp
+    integer j
+    for i = length(s) to 1 by -1 do
+        j = rand(i)
+        if i != j then
+            temp = s[i]
+            s[i] = s[j]
+            s[j] = temp
+        end if
+    end for
+    return s
+end function
+
+function inOrder(sequence s)
+    for i = 1 to length(s)-1 do
+        if compare(s[i],s[i+1]) > 0 then
+            return 0
+        end if
+    end for
+    return 1
+end function
+
+function bogosort(sequence s)
+    while not inOrder(s) do
+        ? s
+        s = shuffle(s)
+    end while
+    return s
+end function
+
+? bogosort(shuffle({1,2,3,4,5,6}))

Task/Sorting-algorithms-Bogosort/Pluto/sorting-algorithms-bogosort.pluto

@@ -0,0 +1,17 @@
+require "table2"
+
+local function is_sorted(a)
+    for i = 1, #a - 1 do
+        if a[i] > a[i + 1] then return false end
+    end
+    return true
+end
+
+local function bogosort(a)
+    while not is_sorted(a) do a:shuffle() end
+end
+
+local a = {31, 41, 59, 26, 53, 58, 97, 93, 23, 84}
+print($"Before: \{{a:concat(", ")}}")
+bogosort(a)
+print($"After : \{{a:concat(", ")}}")

Task/Sorting-algorithms-Bogosort/PowerShell/sorting-algorithms-bogosort.ps1

@@ -0,0 +1,29 @@
+function shuffle ($a) {
+    $c = $a.Clone()  # make copy to avoid clobbering $a
+    1..($c.Length - 1) | ForEach-Object {
+        $i = Get-Random -Minimum $_ -Maximum $c.Length
+        $c[$_-1],$c[$i] = $c[$i],$c[$_-1]
+        $c[$_-1]  # return newly-shuffled value
+    }
+    $c[-1]  # last value
+}
+
+function isSorted( [Array] $data )
+{
+	$sorted = $true
+	for( $i = 1; ( $i -lt $data.length ) -and $sorted; $i++ )
+	{
+		$sorted = $data[ $i - 1 ] -le $data[ $i ]
+	}
+	$sorted
+}
+
+function BogoSort ( [Array] $indata ) {
+	$data = $indata.Clone()
+	while( -not ( isSorted $data ) ) {
+		$data = shuffle $indata
+	}
+	$data
+}
+
+$l = 7; BogoSort ( 1..$l | ForEach-Object { $Rand = New-Object Random }{ $Rand.Next( 0, $l - 1 ) } )

Task/Sorting-algorithms-Bogosort/V-(Vlang)/sorting-algorithms-bogosort.v

@@ -1,8 +1,8 @@
 import rand
 
-fn shuffle_array(mut arr []int) {
+fn shuffle_array(mut arr []int)! {
     for i := arr.len - 1; i >= 0; i-- {
-        j := rand.intn(i + 1)
+        j := rand.intn(i + 1)!
         arr[i], arr[j] = arr[j], arr[i]
     }
 }
@@ -16,9 +16,9 @@ fn is_sorted(arr []int) bool {
     return true
 }
 
-fn sort_array(mut arr []int) {
+fn sort_array(mut arr []int)! {
     for !is_sorted(arr) {
-        shuffle_array(mut arr)
+        shuffle_array(mut arr)!
         println('After Shuffle: $arr')
     }
 }
@@ -26,6 +26,6 @@ fn sort_array(mut arr []int) {
 fn main() {
     mut array := [6, 9, 1, 4]
     println('Input: $array')
-    sort_array(mut array)
+    sort_array(mut array)!
     println('Output: $array')
 }

Task/Sorting-algorithms-Bogosort/VBScript/sorting-algorithms-bogosort-1.vbs

@@ -0,0 +1,30 @@
+sub swap( byref a, byref b )
+	dim tmp
+	tmp = a
+	a = b
+	b = tmp
+end sub
+
+'knuth shuffle (I think)
+function shuffle( a )
+	dim i
+	dim r
+	randomize timer
+	for i = lbound( a ) to ubound( a )
+		r = int( rnd * ( ubound( a ) + 1 )  )
+		if r <> i then
+			swap a(i), a(r)
+		end if
+	next
+	shuffle = a
+end function
+
+function inOrder( a )
+	dim res
+	dim i
+	for i = 0 to ubound( a ) - 1
+		res = ( a(i) <= a(i+1) )
+		if res = false then exit for
+	next
+	inOrder = res
+end function

Task/Sorting-algorithms-Bogosort/VBScript/sorting-algorithms-bogosort-2.vbs

@@ -0,0 +1,10 @@
+dim a
+a = array(11, 1, 2, 3, 4, 4, 6, 7, 8)
+
+dim t
+t = timer
+while not inorder( a )
+	shuffle a
+wend
+wscript.echo timer-t, "seconds"
+wscript.echo join( a, ", " )