diff options
Diffstat (limited to 'prolog/problems/sorting/slowest_sort_ever_2')
-rw-r--r-- | prolog/problems/sorting/slowest_sort_ever_2/en.py | 4 | ||||
-rw-r--r-- | prolog/problems/sorting/slowest_sort_ever_2/sl.py | 4 |
2 files changed, 4 insertions, 4 deletions
diff --git a/prolog/problems/sorting/slowest_sort_ever_2/en.py b/prolog/problems/sorting/slowest_sort_ever_2/en.py index e327102..689060c 100644 --- a/prolog/problems/sorting/slowest_sort_ever_2/en.py +++ b/prolog/problems/sorting/slowest_sort_ever_2/en.py @@ -6,8 +6,8 @@ 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]. +?- slowest_sort_ever([2,3,1,5,4], L). + L = [1,2,3,4,5]. </pre>''' hint = {} diff --git a/prolog/problems/sorting/slowest_sort_ever_2/sl.py b/prolog/problems/sorting/slowest_sort_ever_2/sl.py index c62582c..d6cf66b 100644 --- a/prolog/problems/sorting/slowest_sort_ever_2/sl.py +++ b/prolog/problems/sorting/slowest_sort_ever_2/sl.py @@ -6,8 +6,8 @@ slug = 'Uredi seznam elementov s pomočjo naključnih permutacij' description = '''\ <p><code>slowest_sort_ever(L, SL)</code>: seznam <code>SL</code> vsebuje elemente seznama <code>L</code> v naraščajočem vrstnem redu. Časovna zahtevnost algoritma naj bo O(n * n!).</p> <pre> - ?- slowest_sort_ever([2,3,1,5,4], L). - L = [1,2,3,4,5]. +?- slowest_sort_ever([2,3,1,5,4], L). + L = [1,2,3,4,5]. </pre>''' hint = {} |