implement bogosort

CHANGELOG.md

@@ -13,10 +13,12 @@ keeping track of the changes relative to the Nougaro Calculator under the same
 ## upcoming
 
 ### Added
-* Added two modes in the `sort` built-in function: `slow` and `slow-verbose`.
+* Added two modes to the `sort` built-in function: `slow` and `slow-verbose`.
   Both are [slowsort](https://en.wikipedia.org/wiki/Slowsort) implementations,
   the former is silent and the latter prints how much elements are already
   sorted.
+* Added one other mode to the `sort` built-in function: `bogo`.
+  It is a [bogosort](https://en.wikipedia.org/wiki/Bogosort) implementation.
 * Added `math.gcd`, that takes exactly two integer arguments and return their
   gcd.
 

src/runtime/values/functions/sort_builtin_function.py

@@ -19,6 +19,7 @@
 # built-in python imports
 from typing import Coroutine, Any
 import sys
+import random  # for bogosort
 
 
 def _get_comparison_gt(list_to_sort_: list[Value], index_: int) -> tuple[Number, None] | tuple[None, RunTimeError]:
@@ -182,11 +183,22 @@ async def wait_and_append(i_: int):
     elif mode == "slow" or mode == "slow-verbose":  # slowsort
         sorted_ = _true_list_copy(list_to_sort)
         _slow_sort(sorted_, 0, len(sorted_)-1, int(mode == "slow-verbose"))
+    elif mode == "bogo":
+        sorted_ = _true_list_copy(list_to_sort)
+        is_sorted_, error = _is_sorted(sorted_)
+        if error is not None:
+            return result.failure(error)
+        while not is_sorted_:
+            random.shuffle(sorted_)
+            is_sorted_, error = _is_sorted(sorted_)
+            if error is not None:
+                return result.failure(error)
     else:  # mode is none of the above
         return result.failure(RunTimeError(
             mode_noug.pos_start, mode_noug.pos_end,
             "this mode does not exist. Available modes:\n"
             "    * 'timsort' (default),\n"
+            "    * 'bogo',\n"
             "    * 'miracle',\n"
             "    * 'panic',\n"
             "    * 'sleep',\n"

tests/test_file.noug

@@ -858,6 +858,12 @@ def test_nougaro(print_OK)
     assert sort([], "slow") == []
     assert sort([0, -1], "slow") == [-1, 0]
 
+    print("Executing bogosort, this may take an infinite amount of time…")
+    assert sort([1, 2, 3, 4, 3, 2, 1, 5, 2], "bogo") == [1, 1, 2, 2, 2, 3, 3, 4, 5]
+    assert sort([], "bogo") == []
+    assert sort([0, -1], "bogo") == [-1, 0]
+    print("Done.")
+
     assert sort([1, 2, 3, 4, 3, 2, 1, 5, 2, 6, 1, 2, 4, 3, 7], "stalin") == [1, 2, 3, 4, 5, 6, 7]
     assert sort([1, 2, 3, 4, 3, 2, 1, 5, 0, 6, -400, 2, 4, 3, 7], "stalin") == [1, 2, 3, 4, 5, 6, 7]
     assert sort([], "stalin") == []