3 ms·
I think its fast because of the L1 cache or something like that. I dont understand fully but this is what i got
by vijaybritto 8y ago
I think its fast because of the L1 cache or something like that. I dont understand fully but this is what i got
- acqq 8y agoThe fastest version is the fastest because it's the most cache-friendly one of all which were presented. See e.g. https://stackoverflow.com/questions/5200338/a-cache-efficient-matrix-transpose-program https://stackoverflow.com/questions/5200338/a-cache-efficien... But note that robko made an improvement even before making that.
- acqq 8y ago> made an improvement even before Or maybe not: my short experiments with the simplified version based on their algorithm and his JavaScript versions gave some conflicting results. I haven't thoroughly verified them, this note is just to motivate the others to try.