prolog/problems/sorting/slowest_sort_ever_2/en.py


1
2
3
4
5
6
7
8
9
10
11
12
13

# coding=utf-8

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 = {}