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
Monthly Archives: October 2014
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…
