I am trying to calculate the algorithmic effciency (Big-O) of rotating n 3-D vertices using the rotation matrix:
$\begin{bmatrix}1 & 0 & 0 \\0 & cos(a) & -sin(a) \\ 0 & sin(a) & cos(a)\end{bmatrix}$ $\begin{bmatrix}x \\ y \\ z\end{bmatrix}$
I am kind of new to Big-O and have no idea where to start. I am tempted to say O(9n) but the computation requires addition and multiplication so it seems naive. Any feedback is appreciated.
Ok, so after a little searching for 2 matrices (one vertex), one s * m and m * p, the compuational complexity is evaluated at O(smp) or O(3 * 3 * 1) = O(9). It makes sense I guess