*3.6. Computational Complexity*

The computational complexity of the population initialization process of the classical HHO algorithm is O(N), and the computational complexity of the updated mechanism was O(T × N) + O(T × N × D), so the computational complexity of the classical HHO algorithm was O(N × (T + TD + 1)), where *T* was the maximum number of iterations and D the dimension of the specific problem. The computational complexity of the population initialization process of the CSHHO algorithm was O(ND), and the computational complexity of the update mechanism was the same as that of the classical HHO algorithm, so the computational complexity of the CSHHO algorithm was O(N × (T + TD + D)), where *T* was the maximum number of iterations, and D the dimensionality of the specific problem.
