The bottleneck in your program seems the sorting at the end. Sorting is super-linear, which means that if your input size doubles, the running time more than doubles.
I'd write your program slightly different, but that shouldn't make much of a difference:
my (%hash, $line);
while ($line = <STDIN>) {
while (my ($word) = (lc $word) =~ /[a-z]{2,}/g) {
next if $word =~ /(.)\1\1\1\1/;
$hash{$word}++;
}
}
print "$_\n" for sort keys %hash;
Now, if the words are in order, there's no need for the hash, or the sorting:
my ($line, $prev);
$prev = "";
while ($line = <STDIN>) {
while (my ($word) = (lc $word) =~ /[a-z]{2,}/g) {
next if $word =~ /(.)\1\1\1\1/;
next if $word eq $prev;
print "$word\n";
$prev = $word;
}
}
(Code fragments are untested)
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|