this one performs totally different, what is going on there?
Because I asked him if he can make an algorithm that doesnāt care which list is bigger. Maybe I shouldnāt have included it in the final list of others that are specialized for the case when the first list is bigger (although I havenāt inspected all of them in exhaustive detail to make sure of that).
I also removed the Enum.min_max_by
from the start of each implementation so thatās definitely giving different ā and Iād say more objective and in line with the original requirements ā results.
But how come it performs so differently for the same given data in different envirnoments
No idea.
I am super busy lately but since I promised Iāll make a Git repo I just allocated 30 mins last evening and did it. You guys are free to experiment and post findings, Iād be interested.
Maybe you, too, can post your, a-hem, eksperimental findings.
Could please also include the file with the benchmarks, I am mostly interested in the data you used for testing.
From ZipLeft.bench
function:
l0 = Enum.to_list(1..2000)
l1 = [:worker_0, :worker_1, :worker_2, :worker_3, :worker_4]