I\'m trying to write a function that merges and then sorts a list, but now I have two different functions; one that merges it and one that sorts it. So I\'m trying to write another function, that call
Write a function average-above-max, which takes 2 lists, L1 and L2. L1 and L2 are both simple lists, which do not contain nested l开发者_运维技巧ists. Both lists may have non-numeric elements.
There are tons of tutorials on how to curry functions, and as many questions here at stackoverflow. However, after reading The Little Schemer, several books, tutorials, blog posts, and stackoverflow t
I want a macro that create a new identifier like (new-name first second) => first-second that could be used to define new toplevel bindings
We have a list A (1 2 3 4 5 2 2 3 3 3 4 6 7) and we want to get this numbers which number of meets are < then them.
Just trying to get back into the swing of scheme again, because everyone loves recursion.. (mhhmnmm.)
I would like to include all the functions defined in a given racket file so that I get the same 开发者_Python百科effect as if they were copied. Is it possible to do that?To export the functions out of
I have a series of mathmetical operations I need to perform.The input of the function is n. the first two operations are summations.using n.The result needs stored as a variable to be used in later f
开发者_开发百科How do I get elements from 2nd to 7th from a list, using only the following three functions:
After learning a bit of Scheme from SICP, I started reading The Little Schemer (which I find quite entertaining) and am about one fourth done.I noticed that I can write many (most? all?) solutions wit
加载中,请稍侯......