aboutsummaryrefslogtreecommitdiff
path: root/challenge-236/deadmarshal/java
diff options
context:
space:
mode:
authorYves Orton <demerphq@gmail.com>2023-09-28 21:50:55 +0200
committerYves Orton <demerphq@gmail.com>2023-09-28 22:01:15 +0200
commit810bdbc5c6f06dd8a13f5c22e4a2064afa20a5dd (patch)
tree9db3ae07dac348a36a70c34138595dfa8192fb42 /challenge-236/deadmarshal/java
parent200e728ec7b29b6f1807ed966264407834eb9f92 (diff)
downloadperlweeklychallenge-club-810bdbc5c6f06dd8a13f5c22e4a2064afa20a5dd.tar.gz
perlweeklychallenge-club-810bdbc5c6f06dd8a13f5c22e4a2064afa20a5dd.tar.bz2
perlweeklychallenge-club-810bdbc5c6f06dd8a13f5c22e4a2064afa20a5dd.zip
Challenge-236 - "Exact Change" and "Count Loops"
Exact Change - use a simple algorithm to manage the wallet. The problem description makes it seem like there might be a need to recursively try multiple solutions, but in practice this is not necessary. Count Loops - I originally implemented this using a destructive approach with a hash, but in my benchmarks this was slow and also non-determinisitc, and making it deterministic would make it slower. Using an array based approach seems like it would be worse, but in practice, with randomly generated input data a pure array approach was faster. *Shrug*
Diffstat (limited to 'challenge-236/deadmarshal/java')
0 files changed, 0 insertions, 0 deletions