Beefy Boxes and Bandwidth Generously Provided by pair Networks
Do you know where your variables are?
 
PerlMonks  

Re^3: Shuffling cards

by blazar (Canon)
on Feb 23, 2005 at 14:36 UTC ( #433695=note: print w/ replies, xml ) Need Help??


in reply to Re^2: Shuffling cards
in thread Shuffling cards

Yours would fail if you have 10 or more nested parens.
It won't any more, I made the minimal correction that solved this and I hope you will apologize me for not having pointed out explicitly having done so (but it's really a one-char correction).

Incidentally, to be fair I'm not really sure if with input strings limited to 20 chars (as of the rules!!) you can have more than 10 nested parens and thinking about it one more second... no, you can't!


Comment on Re^3: Shuffling cards
Re^4: Shuffling cards
by Anonymous Monk on Feb 23, 2005 at 15:46 UTC
    And then you didn't fix the other \d. Now it still fails on "10b". Yes, I know the rules are for people who can't program and uses arbitrary limits to allow even the most sloppy coders to score a few marks. But that's no excuse for code on perlmonks, is it? ;-)
      And then you didn't fix the other \d. Now it still fails on "10b".
      But then the rules explicitly state that "any numbers will be between 2 and 9 inclusive".
      Yes, I know the rules are for people who can't program and uses arbitrary limits to allow even the most sloppy coders to score a few marks. But that's no excuse for code on perlmonks, is it? ;-)
      Personally I do not share this somewhat elitarist attitude. (Hey, at least that's how I perceive it to be!)

      Also, one should take into account that not everybody is so lucky as to use perl, as we do! I don't dare to imagine how damned complicate it would be to do this, say, in C... (well, it would, for me!)

      Last, I think that it was important to give the OP an answer to what he asked for, i.e. a solution to the proposed problem. Please note, in particular, that I clearly wrote: "sample code to solve the assignment". But of course on PM it's fine to give solutions that also do more than that...

        I don't dare to imagine how damned complicate it would be to do this, say, in C.
        It would be more work in C. I fail to see that a solution in C would be simpler if one can assume the numbers are smaller than 10, or that the string is limited to 20 characters.
        Personally I do not share this somewhat elitarist attitude.
        Well, I think there's no excuse for sloppy code at all. Not on Perl monks, and not outside Perl monks either.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://433695]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (10)
As of 2014-12-18 05:06 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (42 votes), past polls