summaryrefslogtreecommitdiff
path: root/prolog/problems/sorting/isort_2
diff options
context:
space:
mode:
authorAleš Smodiš <aless@guru.si>2015-08-18 16:06:19 +0200
committerAleš Smodiš <aless@guru.si>2015-08-18 16:06:19 +0200
commit95e2fe57f6e4639f6ae9f1fef368829d5090dbf6 (patch)
tree462ba05eb0c4732ca1c97739548801258bf47b40 /prolog/problems/sorting/isort_2
Exported all problems from the SQLite database into the new directory structure.
Diffstat (limited to 'prolog/problems/sorting/isort_2')
-rw-r--r--prolog/problems/sorting/isort_2/common.py18
-rw-r--r--prolog/problems/sorting/isort_2/en.py12
2 files changed, 30 insertions, 0 deletions
diff --git a/prolog/problems/sorting/isort_2/common.py b/prolog/problems/sorting/isort_2/common.py
new file mode 100644
index 0000000..0b1aa47
--- /dev/null
+++ b/prolog/problems/sorting/isort_2/common.py
@@ -0,0 +1,18 @@
+id = 123
+group = 'sorting'
+number = 30
+visible = True
+facts = None
+
+solution = '''\
+sins123(X, [], [X]).
+sins123(X, [Y|T], [X,Y|T]) :-
+ X =< Y.
+sins123(X, [Y|T], [Y|L]) :-
+ X > Y,
+ sins123(X, T, L).
+isort([], []).
+isort([H|T], SL) :-
+ isort(T, ST),
+ sins123(H, ST, SL).
+'''
diff --git a/prolog/problems/sorting/isort_2/en.py b/prolog/problems/sorting/isort_2/en.py
new file mode 100644
index 0000000..3a3dea0
--- /dev/null
+++ b/prolog/problems/sorting/isort_2/en.py
@@ -0,0 +1,12 @@
+id = 123
+name = 'isort/2'
+slug = 'sort a list using insertion sort'
+
+description = '''\
+<p><code>isort(L, SL)</code>: the list <code>SL</code> contains the elements of <code>L</code> sorted in non-decreasing order. Use the predicate <code>sins/3</code> to implement insertion sort.</p>
+<pre>
+ ?- isort([2,3,1,5,4], L).
+ L = [1,2,3,4,5].
+</pre>'''
+
+hint = {}