diff options
Diffstat (limited to 'prolog/problems/lists/insert_3')
| -rw-r--r-- | prolog/problems/lists/insert_3/en.py | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/prolog/problems/lists/insert_3/en.py b/prolog/problems/lists/insert_3/en.py index 0de098b..d246932 100644 --- a/prolog/problems/lists/insert_3/en.py +++ b/prolog/problems/lists/insert_3/en.py @@ -23,7 +23,7 @@ the problem is one element smaller now) insert into the tail, and at the end don head previously taken away.</p> ''', '''\ <p>Recursive step: if we assume <code>NewTail</code> is the tail with already inserted element <code>X</code>, -then <code>[H|NewTail]</code> is the whole list with the element <code>X</code> inserted.</p> +then <code>[H|NewTail]</code> is the whole list with element <code>X</code> inserted.</p> '''] hint = { @@ -79,7 +79,7 @@ or something similarly impossible).</p> <p><img src="[%@resource lost_heads.svg%]" /></p> <p>The element has been successfully inserted, but all the others before it are lost, right? Did you forget to put the head back at the front of the list after returning from recursion?</p> -<p>Try asking prolog the following query and check <em>all</em> the solutions:</p> +<p>Try asking the following query and check <em>all</em> the solutions:</p> <p><code>?- insert(q, [a,b,c,d], L).</code></p> ''', |