Data update

Task/Sorting-algorithms-Bogosort/EMal/sorting-algorithms-bogosort.emal

@@ -0,0 +1,19 @@
+type BogoSorter
+fun inOrder ← logic by List list
+  if list.length ≤ 1 do return true end
+  for int i ← 1; i < list.length; ++i
+    if list[i] < list[i - 1] do return false end
+  end
+  return true
+end
+fun shuffle ← <List list|list.shuffle()
+fun sort ← void by List list
+  while not inOrder(list)
+    shuffle(list)
+  end
+end
+type Main
+List sample ← int[3, 4, 1, 8, 7, 4, -2]
+BogoSorter.sort(sample)
+sample.list(<int n|write(n + " "))
+writeLine()