Table 3.

ADSCFGWO algorithm’s computational complexity.

No.	Operation	Complexity
1	Initialization	$O\left(1\right)$
2	Calculate objective function	$O\left(n\right)$
3	Finding best solutions	$O\left(n\right)$
4	Updating position of current grey wolf by fitness	$O(t_{max}\times n)$
5	Updating position of current individual by Sine Cosine	$O(t_{max}\times n)$
6	Updating objective function	$O(t_{max}\times n)$
7	Finding best fitness	$O\left(t_{max}\right)$
8	Updating parameters	$O\left(t_{max}\right)$
9	Producing the best fitness	$O\left(1\right)$