Say I have the list \'(1 2 3 (4 5 6) 7 8 9). It should return (9 8 7 (6 5 4) 3 2 1) using the following code below. I\'m trying to understand how this iterative process works. Showing how this is done
Given a list, each item of which is an (r g b) color, return a list consisting of 开发者_高级运维the
For some reason I\'m having trouble running MIT scheme. On my Dell, which runs Windows Vista, I can\'t even open MIT scheme; I get a message: \"Heap Size exceeded\", or something like that. I can run
I need a function that will take in a list of characters and numbers, and then return the numbers added up (ignoring the characters). This is what I have so far:
What is the function to reverse a list in Scheme? It needs to be able to handle nested lists. So that if you do somet开发者_如何学Gohing like (reverse \'(a (b c d) e)) you\'ll get (e (b c d) a) as the
Sorting a list of Colors. If two colors’ red values are the same, then the one with smaller green value appears first in the ordering. If two colors have the same red an开发者_Go百科d green value, t
In DrScheme, how can I create an association list from 2 lists? For example, I have, y = ( 1 2 3 ) x = 开发者_JS百科( a b c )
I\'m learning Scheme in a class and my professor doesn\'t answer questions after 8:00, so I\'m hoping you all can help me out.Basically I have a family tree type thing and I\'m trying to get all the a
We\'ve been taught various syntax and told how to write开发者_StackOverflow中文版 definitions, but we\'ve never written any code an ran it. What is the order that Scheme code runs in?
So I\'m playing around with a simple doc-string system as a warmup in scheme, the idea being you could do something like:
加载中,请稍侯......