Question: Ocaml : Sorted lists Considering the same functions for ordered lists in the previous question, recall our proof that is elem e (place e l)
Ocaml : Sorted lists
Considering the same functions for ordered lists in the previous question, recall our proof that
is elem e (place e l)
Explain why we could make this claim even though the argument does not require that the list l
be sorted but is elem seems to assume that the list is sorted.
Is the premise sorted l needed in the proof for question 6? Explain why or why not.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
