in reply to Re^3: This runs WAY too slow
in thread This runs WAY too slow

Of course, after posting this, I think I figured it out.

       if ( $dr4 < 0 ) {
           #pre-populate deletion array;
           my @delarray = ( 0 .. $chntot );
           @dlarray = shuffle @delarray;

           my $cndiea = 0;
           foreach my $del ( 0 .. $chntot ) {
               if ( $aod[$del][$yb] eq 'd' ) {
                   $cndiea++;
               }
           }
           my $cnr = $cndiea;
           for my $xd ( 0 .. $chntot ) {
               my $xda = $dlarray[$xd];
               if ( $aod[$xda][$yb] eq 'a' && $cnr < $incrsdel ) {
                   $aod[$xda][$yb] = 'd';
                   $cnr++;
               }
           }
       }

[download]

Replies are listed 'Best First'.
Re^5: This runs WAY too slow
by GrandFather (Saint) on Jan 17, 2011 at 08:04 UTC
    Of course, after posting this, I think I figured it out.

    Around here that is considered a very good outcome and one of the reasons we like people to try to reproduce their problem with a small stand alone sample. Trying to isolate the problematic code very often results in an analysis of the code that otherwise is hard to achieve. In fact many monks who have been around here a while (myself included) find that the process of trying to generate a small stand alone script for posting in a SOPW gets the problem solved before the SOPW gets written.

    Please though, read ELiSHEVA's node carefully and follow as much of her advice as you can. She offers lots of very good advice that will help improve you code to make it faster and more maintainable.

    True laziness is hard work
[reply]

In Section Seekers of Perl Wisdom