I am trying to get a random string from a list of strings in scheme. Example List 开发者_运维技巧( \"this\" \"that\" \"today\" \"yesterday\")
I am trying to remove members which exists in a string from a list consisting of those members. Example:
I tried an example where we need to pass a list as arguments and if condition succeeds I want to add result to a new list.
So I need to calculate the longest common subsequence of two lists, but it needs to be in polynomial time. The only problem i\'m having is that I\'m n开发者_如何学JAVAot allowed to use \"!\" at all. T
While 开发者_JAVA技巧trying to write a solution to the longest common sublist problem in Scheme, I\'m having trouble figuring out what is wrong with what I have so far.I think it\'s the right idea and
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
I am reading DrRacket document http://docs.racket-lang.org/guide/binding.html There is a function (define f
So here\'s my code: (define *graph* (read(open-input-file \"开发者_开发技巧starbucks4.sxml\")))
This is my code: (define p (read(open-input-file \"starbucks4.sxml\"))) (define get-artifacts (lambda (l)
加载中,请稍侯......