# Scalar by N component vector multiplication faster than O(N)?

Is there a way to multiply scalar by vector faster than just multiplying each element of the vector by that scalar?

It feels to me that there should be some exploit to do that. After all we will multiply two vectors elementwise in N steps. The original problem is simpler as it's only scalar by vector. Shouldn't we be able to use the sparsness in our advantage?

You seem to be focused on only one operand, the scalar. You can't get away from the fact that the other operand, the vector, contains $N$ elements and each of them need to be multiplied by the scalar. So, in general, there's nothing sparse about that. It just so happens that each of $N$ elements must get multiplied by the same number.