This is a problem which might come up during a job interview, to try to figure out, how do you think. And it goes something like: “Can you count (i.e. print each number), from 1 to 100, without using a loop?” Now some languages will have some special functions which you can use to do…
The Tower of Hanoi, sometimes called the Tower of Brahma puzzle, is one of the classic problems to look at if you want to learn recursion. It is good to understand how recursive solutions are arrived at and how parameters for this recursion are implemented. The basics of the problem is that you have a…
Watch it on YouTube. In a previous example we got a list of sub directories for a given parent directory. But what it couldn’t do, is get the list of directories, under any of those directories. If we wanted to get all the children, grand children, great grand children, etc. of a directory, we need…
