I am writing a program in scheme, that uses recursion to walk through the list, and stop at certain pointer, when counter reaches a certain number N
I\'m reading the following section of SICP http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-26.html#%_sec_4.1.7
Got these examples I would like to understand but they are in Scheme. I would like them in Clojure :D
I have a weird Scheme question. This is a part of something bigger that I\'m helping a friend with. I need to convert a Tree:Data into an image that accurately represents the tree (I\'m sorry I don\'
Reading through more SICP and I\'m stuck on exercise 1.3.8. My code works properly for approximating 1/phi, but doesn\'t work for approximating e - 2.
I\'m working on a deque in Scheme (SI开发者_Go百科CP exercise 3.23) and I\'ve got a simple doubly-linked list implementation I would like to test out, but I can\'t seem to find out how to print out a
I am trying something out in Scheme for fun.I\'m trying to make an Area function that gets the type of the thing it\'s operating on and then calls a different function depending on the type of object.
I am trying to write a function which computes the length of the longest common subsequence of the two input strings str1 and str2.
I have this code guile> (cairo-pdf-surfac开发者_如何学运维e-create \"foo.pdf\" 100.0 100.0)
i was looking at implementing the bfs in scheme to solve the 8 puzzle problem, this is the code i have so far (giving some error im unable to debug)::
加载中,请稍侯......