summaryrefslogtreecommitdiff
path: root/prolog/problems/lists_advanced/min_2/en.py
diff options
context:
space:
mode:
authorTimotej Lazar <timotej.lazar@fri.uni-lj.si>2016-03-17 14:19:45 +0100
committerTimotej Lazar <timotej.lazar@fri.uni-lj.si>2016-03-17 14:19:45 +0100
commitcf4e59c9d6bce337514fc7d77120baced0d6d7bc (patch)
tree33f7cd7d3ae9595ad548427f3a718f5918935e53 /prolog/problems/lists_advanced/min_2/en.py
parenta9416de1d2bde1b2327928717d00d262160912af (diff)
Prolog: split lists exercises into two groups
Diffstat (limited to 'prolog/problems/lists_advanced/min_2/en.py')
-rw-r--r--prolog/problems/lists_advanced/min_2/en.py15
1 files changed, 15 insertions, 0 deletions
diff --git a/prolog/problems/lists_advanced/min_2/en.py b/prolog/problems/lists_advanced/min_2/en.py
new file mode 100644
index 0000000..18f45a6
--- /dev/null
+++ b/prolog/problems/lists_advanced/min_2/en.py
@@ -0,0 +1,15 @@
+# coding=utf-8
+
+name = 'min/2'
+slug = 'find the smallest element'
+
+description = '''\
+<p><code>min(L, Min)</code>: <code>Min</code> is the smallest value in the list <code>L</code>.</p>
+<pre>
+?- min([5,4,1,6], M).
+ M = 1.
+?- min([3,2,2], M).
+ M = 2.
+</pre>'''
+
+hint = {}