Coin change problem (variation of change making problem)

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

Posted in Algorithm, Programming Tagged with:

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

Posted in Programming Tagged with: ,

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.

Posted in Programming Tagged with:

This is a new post

This is a new post

Posted in Cat1