PWC 179

PWC 179

These are somewhat quick and dirty attempts as I have less spare time this week.

Challenge 1 (ordinal numbers)

Challenge 1 asks for a numeric input to be represented in words (in English) as an ordinal number, e.g., 62 -> sixty-second.

The easiest way to do this in Perl 5 is via the Lingua::EN::Numbers package or one of its relatives. The ready-made num2en_ordinal subroutine does what we need.

In Raku, it is easiest to use Lingua::EN::Numbers again via Inline::Perl 5.

In Julia too, I just run Perl 5 one-liners using Julia's backtick notation (documented here).

So effectively I have three Perl 5 scripts wrapped slightly differently.

 
I found out later that Raku has its own Lingua::EN::Numbers, so one doesn't have to call the Perl 5 module.

Challenge 2 (Unicode sparkline)

Sparklines are inline graphics. We are asked to represent an array of numbers as a sparkline using unicode characters.

I use the three unicode characters ▂  ▁  and ▃ to represent items in the array that are respectively within one standard deviation of the median (▂), more than one standard deviation less than the median (▁) i.e., in the left tail, or more than one standard deviation greater than the median (▃), i.e., in the right tail.

So for the array of numbers (1,2,3,4,5,4,3,2,1), my programs print out: ▁▂▂▂▃▂▂▂▁.

 



Comments

Post a Comment

Popular posts from this blog

PWC 215

PWC 215 I have attempted the Perl Weekly Challenge after a hiatus of several weeks, as I was too busy at work. Still busy, so I have just attempted the current challenge in Perl 5. Like I like to do, I have restricted myself to perl 4 syntax as specified in the first edition of Programming perl. Update and disclaimer : These programs will not work on Perl 4 as I discovered later when I found and installed a Perl 4.019 executable. For one thing, the ability to assign a subroutine to a locally scoped typeglob was not available in Perl 4. Challenge 1 (Odd one out) In this challenge, we are given a list of alphabetic strings, and asked to return the list without the strings in which the characters are not sorted (I assume that this means sorted in lexical ascending order). We are also asked to print the number of strings that were removed (i.e., that were not sorted).  I use a subroutine &odd_one_out(@words) with a nested helper sub-sub-routine to check if a string is sorted. Here i
Read more

PWC 227

PWC 227 Challenge 1 (Friday 13th) This challenge requires us to count the number of times Friday 13th occurs in a particular year. I use Date::Manip. This module probably has easier ways to do this using a Date Range, but my approach is easy enough. My &friday_13th subroutine takes the year as input, throws an exception if it is outside the specified range (1753 to 9999), and then cycles through the 13th of each month, counting the Fridays. use Date::Manip; my $dateobj=Date::Manip::Date->new(); sub friday_13th {     my ($year)=@_;     my $retval=0;     ( ($year > 9999) || ($year < 1753) ) &&         die "Year should be between 1753 and 9999";     map {         ( ($dateobj->new_date("$year-$_-13")->printf('%w') ) == 5 ) &&             $retval++;     }     1 .. 12;          $retval; }   Challenge 2 (Roman Maths) This challenge requires us to implement a calculator that parses infix math operations using roman numerals.  There
Read more

PWC 234

PWC 234 I tried to restrict to Perl 4 syntax for both challenges this week, as documented in Rex Swain's Perl 4 reference or the 1st edition of Programming perl. I do use nested subroutines, which I am not sure would actually work in Perl 4, though they comply with the syntax. My programs are tested on Perl 5.38. (The -l in the shebang line works only in Perl 5. The Perl 4 equivalent was -L012 in Unix, which is no longer available.) As I have mentioned before, my aims in using the old syntax are just mild nostalgia plus to add a bit of additional challenge to the task. I know that this is not the most efficient or idiomatic way to do things today. But I should observe that it is really cool that I am able to write code using 30-year old syntax, and run it unmodified on the latest Perl 5.38. You cannot do this with Python 3 for example. This very deep backward compatibility is one of those unsung underappreciated beauties of Perl 5. In my opinion, it is a very cool thing in
Read more