Question: In OCaml programming language * Write a function that takes two integer lists (not necessarily * sorted) and returns true precisely when the first list
In OCaml programming language

* Write a function that takes two integer lists (not necessarily * sorted) and returns true precisely when the first list is a sublist *of the second * The first list may appear anywhere within the second, but its elements * must appear contiguously * HINT: You should define and test a helper function that you can use *in sublist. ) * Write a function that takes two integer lists (not necessarily * sorted) and returns true precisely when the first list is a sublist *of the second * The first list may appear anywhere within the second, but its elements * must appear contiguously * HINT: You should define and test a helper function that you can use *in sublist. )
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
