summaryrefslogtreecommitdiff
path: root/prolog/problems/sorting/quick_sort_2/en.py
diff options
context:
space:
mode:
Diffstat (limited to 'prolog/problems/sorting/quick_sort_2/en.py')
-rw-r--r--prolog/problems/sorting/quick_sort_2/en.py12
1 files changed, 12 insertions, 0 deletions
diff --git a/prolog/problems/sorting/quick_sort_2/en.py b/prolog/problems/sorting/quick_sort_2/en.py
new file mode 100644
index 0000000..b0d4ce1
--- /dev/null
+++ b/prolog/problems/sorting/quick_sort_2/en.py
@@ -0,0 +1,12 @@
+id = 125
+name = 'quick_sort/2'
+slug = 'sort a list using quicksort'
+
+description = '''\
+<p><code>quick_sort(L, SL)</code>: the list <code>SL</code> contains the elements of <code>L</code> sorted in non-decreasing order. Use the predicate <code>pivoting/4</code> to implement quicksort.</p>
+<pre>
+ ?- quick_sort([2,3,1,5,4], L).
+ L = [1,2,3,4,5].
+</pre>'''
+
+hint = {}