okay, so were doing recursion write now and our program is that we're onna be given a grid with letters in it and a string

For example:

h h h h h h
h h a a h h h
h h n n h h * grids can be regular or irregular
h h n n h h
h h a a h h h
h h h h h h

String = "hannah"

We have to count every possible way to spell hannah out of that and you are allowed to use a letter twice like for hannah you can use the same a and so on

anyone have any idea for an algorithm or formula to solve this?

it doesnt have to be in language just the logic of it


PLZ AND THANK YOU!


definately due this week dunno when for sure

Seeing how its friday, I will assume you turned this assignement in alreay. If you need this reopened, pm me.

Topic Closed.