I need to calculate complexity analysis of metaheuristic algorithm

I need to calculate complexity analysis of metaheuristic algorithm

[Sam Chak]

@Saleh Altbawi

Can you display the mathematical formula for calculating the complexity analysis?

[Saleh Altbawi]

I need idea about doing complexity analysis in metahuristic algorithms . such as O(n), O(logn). How much time requires? and how much large data?

[Sam Chak]

@Saleh Altbawi, Is this a mathematical question or a MATLAB-related question? If former, then better invite a mathematician like @John D'Errico for advice. I have found some info about the Big O notation and the Time complexity.

[Torsten]

Try

https://scicomp.stackexchange.com/

Of course, you will have to explain your problem in more detail in order to get an answer.

[Saleh Altbawi]

Are there any code related to( Big O notation and the Time complexity or (O(n), O(logn)) can be applied to metaheuristic algorithm like PSO or GA.

[Torsten]

Time complexity of algorithms cannot be calculated by code. It must be deduced theoretically.

[Saleh Altbawi]

please @Torsten sir, if you know any reference or any source explain how to deduced the complexity of algorithm

[Torsten]

https://www.amazon.de/Combinatorial-Optimization-Algorithms-Complexity-Computer/dp/0486402584

beginning with Chapter 8.

For an overview

https://en.wikipedia.org/wiki/Time_complexity

But the usual complexity considerations do not seem to apply to metaheuristic algorithms. So try a google search "complexity of metaheuristic algorithms".