2 ms·
But this doesn't argue for the low-to-high order, because of reversed(). This code would be simpler and faster with the coefficients in the opposite order.
by abecedarius 8y ago
But this doesn't argue for the low-to-high order, because of reversed(). This code would be simpler and faster with the coefficients in the opposite order.
- rzzzt 8y agoYou're right, the process does start from the higher coefficients, and so does not really support the ordering presented. You either need to use foldr to defer the multiply-and-add until the end of the list is processed, or reverse the list before processing it.