summaryrefslogtreecommitdiff
path: root/prolog/problems/sorting/slowest_sort_ever_2/en.py
diff options
context:
space:
mode:
Diffstat (limited to 'prolog/problems/sorting/slowest_sort_ever_2/en.py')
-rw-r--r--prolog/problems/sorting/slowest_sort_ever_2/en.py12
1 files changed, 12 insertions, 0 deletions
diff --git a/prolog/problems/sorting/slowest_sort_ever_2/en.py b/prolog/problems/sorting/slowest_sort_ever_2/en.py
new file mode 100644
index 0000000..3018ec6
--- /dev/null
+++ b/prolog/problems/sorting/slowest_sort_ever_2/en.py
@@ -0,0 +1,12 @@
+id = 126
+name = 'slowest_sort_ever/2'
+slug = 'sort a list by randomly permuting elements'
+
+description = '''\
+<p><code>slowest_sort_ever(L, SL)</code>: the list <code>SL</code> contains the elements of <code>L</code> sorted in non-decreasing order. Average and worst case running time is O(n * n!).</p>
+<pre>
+ ?- slowest_sort_ever([2,3,1,5,4], L).
+ L = [1,2,3,4,5].
+</pre>'''
+
+hint = {}