2 files changed, 37 insertions, 0 deletions
diff --git a/prolog/problems/sorting/slowest_sort_ever_2/common.py b/prolog/problems/sorting/slowest_sort_ever_2/common.py
new file mode 100644
index 0000000..5f4c283
--- /dev/null
+++ b/prolog/problems/sorting/slowest_sort_ever_2/common.py
@@ -0,0 +1,25 @@
+id = 126
+group = 'sorting'
+number = 33
+visible = True
+facts = None
+
+solution = '''\
+del126(X, [X|T], T).
+del126(X, [Y|T], [Y|L]) :-
+  del126(X, T, L).
+
+permute126([], []).
+permute126(L, [X|P]) :-
+  del126(X, L, L1),
+  permute126(L1, P).
+
+is_sorted126([_]).
+is_sorted126([H1,H2|T]) :-
+  H1 =< H2,
+  is_sorted126([H2|T]).
+
+slowest_sort_ever(L, S) :-
+  permute126(L, S),
+  is_sorted126(S).
+'''
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 = {}