summaryrefslogtreecommitdiff
path: root/prolog/problems/sorting/slowest_sort_ever_2
diff options
context:
space:
mode:
authorAleksander Sadikov <aleksander.sadikov@fri.uni-lj.si>2015-12-14 13:57:29 +0100
committerAleksander Sadikov <aleksander.sadikov@fri.uni-lj.si>2015-12-14 15:25:36 +0100
commit384d3c501a38b489312496b0bf9522bdf29053d8 (patch)
treebd1a81ce29449ee7f8d017b86365fda710afaf96 /prolog/problems/sorting/slowest_sort_ever_2
parent4918cebf5f135993cd1d2d61bc906559e627f526 (diff)
Add Slovenian translations for Prolog exercises
Diffstat (limited to 'prolog/problems/sorting/slowest_sort_ever_2')
-rw-r--r--prolog/problems/sorting/slowest_sort_ever_2/sl.py13
1 files changed, 13 insertions, 0 deletions
diff --git a/prolog/problems/sorting/slowest_sort_ever_2/sl.py b/prolog/problems/sorting/slowest_sort_ever_2/sl.py
new file mode 100644
index 0000000..c62582c
--- /dev/null
+++ b/prolog/problems/sorting/slowest_sort_ever_2/sl.py
@@ -0,0 +1,13 @@
+# coding=utf-8
+
+name = 'slowest_sort_ever/2'
+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].
+</pre>'''
+
+hint = {}