From: JD KF Date: 2013-07-31T12:00:35+09:00 Subject: Re: Working through Ch.10 for learning to program 2.0 (Chris Pine) So, I am just taking a detour away from the book for a bit and trying something else and will go back to it. I glanced at the solution for one you all wrote out. The book didn't really go over a lot of what you all are doing. When I go back to the book, I'm going to attempt to do it without recursion and then with recursion. However, I am really curious if someone could give me a semi hint on how to do it without recursion based off my card swap example. My guess is it would involve a while loop that does a swap something like this: if a>b X++ Y++ elsif a==b check next letter and compare else swap a and b Honestly its a bit confusing to me. I haven't thought about it much because again I am taking a quick detour away from the book and trying an online detour to see if it might help me. I get the idea of it, I just have a hard time putting it into ruby code I guess. Marcus, it sounds like you read the same book. Could you maybe give me a hint based off what I should know from the book? It looks like many people here are using things that weren't taught in the book. Not saying they are wrong, but it not something I probably know from what I read in the book. I might be wrong though. I'm still learning either way. -- Posted via http://www.ruby-forum.com/.