I want to calculate the computational complexity in term of the big (O). My equation is:
Where the $S^+$ and $S^-$ are calculated as follows:
Where $\triangle_TOPSIS$ It composed of $2m^2$ divisions and $2m^2$ addition. While $S^+$ and $S^-$ composed of $2n$ additions and $2n$ multiplication. My question is that how can I write the computational complexity for $\triangle_{TOPSIS}$ ?
It is O($2m^2$ $\times$ $2m^2$ $\times$ $2n \times 2n$ )? or O($2m^2$ $+$ $2m^2$ $+$ $2n + 2n$ )