Thus during each iteration, the improved algorithm complexity is O (3N + NlogN + ND), higher than the standard locust complexity of the algorithm O (ND)
Therefore, in the course of each iteration, the improved algorithm complexity is O (3N and NlogN-ND), which is higher than the complexity o (ND) of the standard locust algorithm.
Therefore, in each iteration, the complexity of the improved algorithm is O (3N + nlogn + nd), which is higher than that of the standard locust algorithm<br>