Search:

When I run it, my pc starts to freeze up like it's in an infinite loop so I have no clue what it does correctly. I don't know how to make it walk the maze while pushing and popping the stack.

I need to create a maze solver using a stack (not recursively). The maze always starts at [0][0] and ends at [mazeSize-1][mazeSize-1]. 0=open path, 1=wall.
How can I make my program walk the maze...

The program I am required to write reads in a text file and spell checks it. The program also reads in another text file that has a couple words that are correctly spelled and stores it in a "bag"....