diff options
| author | Timotej Lazar <timotej.lazar@fri.uni-lj.si> | 2016-01-13 13:51:15 +0100 |
|---|---|---|
| committer | Timotej Lazar <timotej.lazar@fri.uni-lj.si> | 2016-01-13 13:51:15 +0100 |
| commit | 388b32039898cc8f1784378689007254eb7a33b6 (patch) | |
| tree | ac9e4c6145ad323dc5479179a04f44bbcea73eff /prolog/problems/sorting/quick_sort_2 | |
| parent | e36a8a2feca7552d236c0f6e89ac73e7e690e7b1 (diff) | |
Remove space-padding from <pre> blocks
Diffstat (limited to 'prolog/problems/sorting/quick_sort_2')
| -rw-r--r-- | prolog/problems/sorting/quick_sort_2/en.py | 4 | ||||
| -rw-r--r-- | prolog/problems/sorting/quick_sort_2/sl.py | 4 |
2 files changed, 4 insertions, 4 deletions
diff --git a/prolog/problems/sorting/quick_sort_2/en.py b/prolog/problems/sorting/quick_sort_2/en.py index faf6d41..3457440 100644 --- a/prolog/problems/sorting/quick_sort_2/en.py +++ b/prolog/problems/sorting/quick_sort_2/en.py @@ -6,8 +6,8 @@ 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]. +?- quick_sort([2,3,1,5,4], L). + L = [1,2,3,4,5]. </pre>''' hint = {} diff --git a/prolog/problems/sorting/quick_sort_2/sl.py b/prolog/problems/sorting/quick_sort_2/sl.py index 9611b46..8b6ad94 100644 --- a/prolog/problems/sorting/quick_sort_2/sl.py +++ b/prolog/problems/sorting/quick_sort_2/sl.py @@ -6,8 +6,8 @@ slug = 'Uredi seznam z algoritmom quicksort' description = '''\ <p><code>quick_sort(L, SL)</code>: seznam <code>SL</code> vsebuje elemente iz <code>L</code> urejene v naraščajočem vrstnem redu. Uporabi predikat <code>pivoting/4</code> za implementacijo algoritma quicksort.</p> <pre> - ?- quick_sort([2,3,1,5,4], L). - L = [1,2,3,4,5]. +?- quick_sort([2,3,1,5,4], L). + L = [1,2,3,4,5]. </pre>''' hint = {} |