[CommandorInChief]

This recursion is supposed to solve a 2d array maze of n size.

Here's the given algorithm:
Begin with the maze's space with no walls. Call this a chamber. Divide the chamber with a randomly positioned wall where each wall contains a randomly positioned passage opening within it. Then recursively repeat the process on the subchambers until all chambers are minimum sized.

I'm really not sure how to even start this off. Sorry I don't have a specific question besides just where to start or simply, how to write this. Any help would be greatly appreciated. Thanks.

[pbl]

I guess you should start with a class Chamber
that holds instances of the class Wall