It might also be a good move to read this:
http://www.catb.org/esr/faqs/smart-questions.html#intro
On Wed, Jun 28, 2017 at 12:21 PM, Glenn Hoetker wrote:
> If order doesn't matter and it would be okay for duplicates *within* a
> list to be deleted, you might make use of
>
> * Lists can be conver
If order doesn't matter and it would be okay for duplicates *within* a list to
be deleted, you might make use of
* Lists can be converted to sets, via list->set and back again
* There are many set methods to yield unions, intersections and differences
between sets. See https://docs.racket-lang.o
Consider using the following function
https://docs.racket-lang.org/reference/pairs.html?q=memq#%28def._%28%28lib._racket%2Fprivate%2Fbase..rkt%29._memq%29%29
It's helpful to sketch out the general steps you'd need to be able to carry out
the procedure to solve the problem.
My quick sketch would
3 matches
Mail list logo
