Scheme. Tail recursive ?

Posted by n00b on Stack Overflow See other posts from Stack Overflow or by n00b
Published on 2010-04-24T14:43:49Z Indexed on 2010/04/24 14:53 UTC
Read the original article Hit count: 384

Filed under:

Scheme

|

tail

|

recursion

|

homework

Hi guys, any tail-recursive version for the below mentioned pseudocode ? Thanks !

(define (min list)
    (cond 
      ((null? list '())
      ((null? (cdr list)) (car list))
           (#t (let ((a (car list))
                     (b (min (cdr list)))
                     )
                 (if (< b a) b a)
                 )
               )
           )
      )

© Stack Overflow or respective owner

Related posts about Scheme

About "If.." in Scheme (plt-scheme)

as seen on Stack Overflow - Search for 'Stack Overflow'
I had a pretty simple requirement in my Scheme program to execute more than one statement, in the true condition of a 'if'. . So I write my code, something like this: (if (= 1 1) ((expression1) (expression2)) ; these 2 expressions are to be executed when the condition is true (expression3)… >>> More
Detecting EOF in a Binary File using Scheme

as seen on Stack Overflow - Search for 'Stack Overflow'
(define (read-all-input) (local ((define line (bytes->list (read-bytes 4)))) (if (eof-object? line) empty (cons line (read-all-input))))) (void (read-all-input)) The above code fails because bytes-list expects an argument of type byte string, but is given # >>> More
Scheme: Detecting duplicate elements in a list

as seen on Stack Overflow - Search for 'Stack Overflow'
Does R6RS or Chez Scheme v7.9.4 have a library function to check if a list contains duplicate elements? Alternatively, do either have any built in functionality for sets (which dis-allow duplicate elements)? So far, I've only been able to find an example here. The problem with that is that it doesn't… >>> More
Traversing Scheme function as a list

as seen on Stack Overflow - Search for 'Stack Overflow'
Isn't it possible to treat functions in Scheme as any other list? Basically, what I want do to is something like this: (define (foo) "hello") (cdr foo) ; or similar, should return the list ((foo) "hello") I've found a similar discussion about this, and I feel a bit disappointed if this is not… >>> More
Scheme implementations - what does it mean?

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, I'm a beginning student in CS, and my classes are mostly in Java. I'm currently going through "Little Schemer" as a self study, and in the process of finding out how to do that I have found numerous references to "implementations" of Scheme. My question is, what are implementations? Are they… >>> More

Related posts about tail

The Long Tail and Short Tail of Search Keywords

as seen on Ezine Articles - Search for 'Ezine Articles'
Should keywords be short so that people can find them easily or should they be two or three word phrases to enable better ranking? Read on to find out. >>> More
Looking for a windows equivalent of the unix tail command

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm looking for the equivalent of the unix 'tail' command that will allow me to watch the output of a log file while it is being written to. >>> More
SEO & SEM Long Tail Keyword Marketing Strategy

as seen on Ezine Articles - Search for 'Ezine Articles'
Long tail marketing strategies for SEO & SEM often return higher conversion rates by up to 200% as compared to short tail generic keyword terms. These long tail keyword terms can be extremely profitable for SEM (search engine marketing) in terms of lower cost or bid for keywords and larger returns… >>> More
Sting in the tail for web's video codec search

as seen on Internet.com - Search for 'Internet.com'
<b>ZDNet:</b> "The search for the next-generation video codec for the open web has reached an impasse. Few of the options are truly open or free, and those that are free are not being pushed by the major forces." >>> More
Sorting a list in OCaml

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi All, Here is the code on sorting any given list: let rec sort lst = match lst with [] -> [] | head :: tail -> insert head (sort tail) and insert elt lst = match lst with [] -> [elt] | head :: tail -> if elt <= head then elt :: lst else head :: insert elt… >>> More