timmyjose/timmyjose.github.io

Technial thoughts, ideas, and experimentation.

timmyjose.github.io's Issues

coin change problem suggestion

A quick suggestion to make the Rust coin change problem more similar to the Zig version:
https://www.reddit.com/r/rust/comments/i1ayyj/the_coin_change_problem_in_ats_rust_and_zig_a/fzvv7wi/

coin change in ats

test2 in https://github.com/dambaev/coin_change contains version with a reference of array, like in Rust.

on my PC it gaves:

coin_change (25) = 13
coin_change (100) = 242
coin_change (1000) = 142511

real	0m0,177s
user	0m0,177s
sys	0m0,000s

in contrast to original one:

oin_change (25) = 13
coin_change (100) = 242
coin_change (1000) = 142511

real	0m0,215s
user	0m0,214s
sys	0m0,001s

Lazy primes implementations are wrong

2020-09-16-lazy-primes-in-idris.md

The output in the implementations have '9' and '15' etc, which are not prime numbers. sieve should be recursive:

sieve (p : xs) = p : sieve (filter (\x -> x `mod` p /= 0) xs)

I'm not sure how this affects the relative performances between the two languages, but 1000000 was definitely too much for my laptop, 10000 itself took 2 seconds in haskell.