 |
.. (לתיקייה המכילה) | |
Examples file
|
You were asked to submit an example file examples.pl. This was a mistake - Please DO NOT submit an examples file in the wet part! an updated version of the exercise was uploaded to the course site. Please note that you still have to provide examples for your code correctness as a part of the dry submittion. |
Hi!
In part beth (sorting) we used cuts. So our output is like:
?- insertsort([9,7,3,5,6,4,4,2,0],L).
L = [0, 2, 3, 4, 4, 5, 6, 7, 9].
And in your examples you return also "false" after the ";"
?- insertsort([9,7,3,5,6,4,4,2,0],L).
L = [0, 2, 3, 4, 4, 5, 6, 7, 9] ;
false.
Should we correct our code and remove cuts in order to get the same output, or its OK to leave it as is? (Sorting works all right!)
| Leave it as is. |
merge function
|
Dear students, apperantly in some version of PROLOG there is a built in predicate called merge. Therefore please change the name of the predicate merge to mymerge an updated version of the exercise and of the examples files will be uploaded to the course site. |
Part c (trees)
Question 1
|
In this part you were asked to define nouns which represent given trees. As you no longer have to submit an examples file - attach the definitions of the nouns to the dry part |