grid traversal question

Question

Possible Duplicate:
Looping in a spiral

Given a grid of any height and width, write an algorithm to traverse it in a spiral. (Starting at the top left and ending in the middle) without passing over previously visited nodes. Without using nested loops.

Wow, did you copy and paste that right out of your homework? — boiler96, May 31 '10 at 22:01
no. my friend needs help. I know how to do it in two nested for loops. Please help! — myusuf3, May 31 '10 at 22:02
http://stackoverflow.com/questions/398299/looping-in-a-spiral — blissapp, May 31 '10 at 22:06
Regarding http://stackoverflow.com/questions/398299/looping-in-a-spiral: That answer started at the center and worked outward, assumes odd dimensions, and has an... interesting... way of handling grids where width and height are not equal. — Mike DeSimone, May 31 '10 at 22:28

score -2 · Answer 1 · answered May 31 '10 at 23:30

-2

it should be done using one for loop and starting from bottom left, I'am in that coarse

answered May 31 '10 at 23:30

David

1

This answer is quite vague and incomplete. Please format your answers better. – Joetjah Aug 12 '13 at 10:25

grid traversal question

1 Answers1