Roelof Wobben <rwob...@hotmail.com> writes: >>> For nth, you need a counter that you can increment in each recursion >>> step. For last, you return the first element of the list whose rest >>> is the empty list. >> >> Thanks, and if I use cons (item, list) then item is the value I >> want. I only have to print it.
I think you should return it, not just print it. > If I look at the documentations I think I have to use doseq for > running and cons for finding and a if then to stop at the right place. No. doseq doesn't allow you to stop after you've found the right item, and cons constructs a new list given an item and another list. You want either an explicit recursion or `loop`/`recur` for running through the list, and in each step you want to use `first` and `rest` to split the list into its head item and its tail. Bye, Tassilo -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.