Miscellaneous > Programming & Networking
Re: Let's play a game, pals.
worker201:
learning a language to create and populate the arrays looks like the tricky part...
Pathos:
It shouldn't take longer than 2 mins to work out the strategy to do it.
It can be very tricky so just set small goals that show your strategy is working.
Think Recursively... What it being repeated?
Then you just need to work out the base steps and how to implement the recursion.
I didn't use an actual 2d dimensional array, I simulated one with a 1d array (n*n) if that helps.
solemnwarning:
i already posted answer
muzzy:
oh c'mon. there are lots of trivial solutions to this spiral thing. you can just write code to do it the way you'd do it on paper.
i suppose i could write a solution for you, but i don't want to spoil the fun if you want to solve it on your own :)
also, recursion isn't the best approach imo, i'd go for a simple state machine with iteration.
KernelPanic:
This is very kludgy, and done in bash. (Doesn't format the results properly)
Please don't laugh! :rolleyes:
When I finish my degree I will be better.
Honest. :D
[verwijderd door de beheerder]
Navigation
[0] Message Index
[#] Next page
[*] Previous page
Go to full version