I came across this video on youtube that talks about greedy algorithms and as an example presents the classic change making problem. It is a very informative introductory video and I would recommend it to anyone who is interested in…
Uday Chettiar
Personal homepage
Blog Archives
Tree traversal without recursion
Tree traversal is a classic algorithm problem that is often presented in introductory classes as an example of how recursion could be used to simplify a seemingly complicated problem. A tree could be traversed in a wide range of ways…
Experiments with Clojure
An example of how lazy sequences work in functional programming and specifically in Clojure. You can use the apply function to get past the lazy sequence.
|
1 2 3 4 5 |
user=> (str (interpose \: "asdf")) "clojure.lang.LazySeq@c49ce839" user=> (apply str (interpose \: "asdf")) "a:s:d:f" |
