Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re: First JAPH - Spell perl in two hundred and eighty five thousand and seventy four easy steps

by /dev/null (Chaplain)
on Sep 11, 2002 at 18:07 UTC ( #197018=note: print w/ replies, xml ) Need Help??


in reply to First JAPH - Spell perl in two hundred and eighty five thousand and seventy four easy steps

Great script!! It gave me plenty of pseudo-base 26 fun. The number is incremented exponentially as the number of characters increases. i.e. devnull in base 26 is:
 ((4*26**6) + (5*26**5) + (22*26**4) + (14*26**3) + (21*26**2) + (12*26**1) + (12*26**0))

The script I used to print the strings as they count:
use strict; my $A="a"; my $Z = 0; while($A ne "devnull") { $A++; $Z++; } print"$A\n"; print"$Z\n";


It would be much easier/faster to add the string to hash, reverse the string in an array, and feed the numbers into the base 26 formula above. By the way, devnull is 1305384039 when the for loop starts at 1.


Comment on Re: First JAPH - Spell perl in two hundred and eighty five thousand and seventy four easy steps
Select or Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (18)
As of 2015-07-01 15:54 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (6 votes), past polls