github/perlweeklychallenge-club.git/challenge-113/james-smith/perl, branch master Unnamed repository; edit this file 'description' to name the repository. links in blogs < & > 2021-11-29T07:12:59+00:00 drbaggy js5@sanger.ac.uk 2021-11-29T07:12:59+00:00 5d92143764fb5c8fce90edd16f6938a8470622b3 






added accessors + blog link
2021-05-19T11:59:31+00:00

drbaggy
js5@sanger.ac.uk

2021-05-19T11:59:31+00:00

7d19752068cca016bfa8417b3c22a2cece0ffa32












speed up loop but also added unrolled version which is 50% faster
2021-05-19T10:59:53+00:00

drbaggy
js5@sanger.ac.uk

2021-05-19T10:59:53+00:00

434eda509d56beaebb3c0aa6c4aea3cc8d1f83c3












just tidying
2021-05-19T10:59:29+00:00

drbaggy
js5@sanger.ac.uk

2021-05-19T10:59:29+00:00

679dc509ad21abb1f6d2365330639b3f40fc7c69












true Binary tree version of the code... write a dump, clone & flatten function which uses walk rather than self coded - all take a fn which allows artibrary code to used when cloning the value and dump/flattening it
2021-05-18T14:18:23+00:00

drbaggy
js5@sanger.ac.uk

2021-05-18T14:18:23+00:00

acf7efe3c26276e986c039273f2df7179de5ab24












add solution when one of the numbers doesn't end in $d
2021-05-18T05:58:43+00:00

drbaggy
js5@sanger.ac.uk

2021-05-18T05:58:43+00:00

d744fbd007daf178752280c7eb5827bedddb6057












even faster with a tweak to logic
2021-05-17T09:59:12+00:00

drbaggy
js5@sanger.ac.uk

2021-05-17T09:59:12+00:00

16edd6150b08e3247722843e8f9069eade984331












faster routine as 1 liner - just sum add see if less than n
2021-05-17T09:48:51+00:00

drbaggy
js5@sanger.ac.uk

2021-05-17T09:48:51+00:00

6edfec5322cf3245ceda4e2a8df176e09aa0360b












First pass at challenge 113
2021-05-17T09:03:40+00:00

drbaggy
js5@sanger.ac.uk

2021-05-17T09:03:40+00:00

f1a12d7a9744491539faea970e041e67816c477e