Re: Re: Sorting characters within a string

[dga]

Nice Idea to precompute the values.

I got 3901 which represents the entire set of 2-4 letter long unsorted inputs in this alphabet. This of course folds to a very small number of sorted outcomes.

Here is the code.

#!/usr/bin/perl
use strict;
use warnings;

my(%pp);
my(@acgnt)=( ' ', 'A', 'C', 'G', 'N', 'T' );
my($i);
for($i=11;$i<100000;$i++)
{
  my($s, $o, @s);
  while($i =~ /6/)
  {
    $o=index(reverse($i),'6');
    $i+=5*10**$o;
  }
  $s=sprintf "%04d", $i;
  @s=split('',$s);
  @s = map { $acgnt[$_] } @s;
  $s=join('', @s);
  $s =~ y/ //d;
  $pp{$s}=join('', sort(@s));
}

#print out the lookup table (not really part of the initializer)
my($k, $v);
while(($k,$v)=each %pp)
{
  print "$k = $v\n";
}

This creates a complete list of inputs you could obtain and builds a hash with the outputs you want to display. It does this fairly quickly and would only have to be done at startup time and then your print statement would bacically be print "$pp{$_}\n";

This could be made into an initializer function or the values could be computed and saved out and then read in for execution of the real program.