I am trying to compute the cube of a bunch of integers, starting from 1 to n.
I am dealing with efficiency and I want to know the fastest way to compute those numbers.
I am currently using x * x * x, rather than Math.pow(x, 3).
I would like to know if my actual solution is the fastest, and if there is any that would be better.
Thank you very much.