| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2021-10-29 | Check for even numbers. | Abigail | |
| In week 136, part 1, if one or both numbers are odd, the pair cannot be two-friendly. | |||
| 2021-10-27 | Implement caching for week 136/part 2. | Abigail | |
| For those language for which it was easy to make use of an associative array/hash/mapping: AWK, Bash, Go, Java, Lua, Node.js, Perl, Python, Ruby and Tcl. Implementations left without caching: bc, C, Pascal, R, and Scheme. | |||
| 2021-10-26 | Use the same function to determine whether a number is a power of 2. | Abigail | |
| We now use the same algorithm (but implemented in different languages) to determine whether a number is a power of 2. This replaces the preprocessed powers of 2, and lookup tables. | |||
| 2021-10-26 | Use recursive algorithms for GCD | Abigail | |
| 2021-10-26 | Call "count()" with just one argument | Abigail | |
| 2021-10-25 | Lua solutions for week 136 | Abigail | |
 |
index : github/perlweeklychallenge-club.git | |
| Unnamed repository; edit this file 'description' to name the repository. |
| aboutsummaryrefslogtreecommitdiff |