3 ms·

There are 2 pieces of C benchmarked. The other one computes `a[i]-b[i]` into a temporary array and then makes a single call to BLAS. The speed is roughly half t

by ky3 14y ago

There are 2 pieces of C benchmarked. The other one computes `a[i]-b[i]` into a temporary array and then makes a single call to BLAS. The speed is roughly half that of Haskell, which dispenses with the space cost of the temporary array.

jules 14y ago
Yes, you're right, the other C code is even less efficient.
- ky3 14y ago
  Good catch! It's the 3x BLAS that's 1/2 of Haskell's speed. The 1x BLAS that uses 2x RAM gets shafted, presumably by cache lossage.