Re: Transposition of each letter pair in string

There is a big discussion going on in the chat room, about this thread, as there are several different interpretations of what the author is actually trying to do.

As for whether there is a more perlier way, I would say, any solution that solves the problem, looks normal, easy to understand would be a good one.

Comment on Re: Transposition of each letter pair in string

Replies are listed 'Best First'.
Re: Re: Transposition of each letter pair in string by sauoq (Abbot) on Dec 27, 2002 at 06:28 UTC
Any way, now we got both cases covered, and hope there is no third one. I think there is a third one. The way his code works makes it clear. He wants not just one string back but a list of them. Each string is exactly the same as the original with exactly one letter pair reversed. Using your example of `"01234567"` [download] the list would be `('10234567', '02134567', '01324567', '01243567', '01235467', '01234657', '01234576')` [download] Notice that the list will always contain one less element than the number of characters in the original string. I agree that his English explanation would seem to suggest Zaxo's solution. His code, however, suggests the above explanation. -sauoq "My two cents aren't worth a dime.";	[reply] [d/l] [select]
Re: Re: Transposition of each letter pair in string by sauoq (Abbot) on Dec 27, 2002 at 05:03 UTC
Code is more precise than English. If he says the code works, the safe assumption is that it actually does work the way he expects and his English description was lacking, not the other way around. -sauoq "My two cents aren't worth a dime.";	[reply]