how to find order of complexity

I have 2 algorithms for PSO and GA,now i want to find order of complexity ,i searched in internet but could not find any formula for this,kindly can any one tell how to proceed plz

Answer 1

[Walter Roberson]

There is no formula for it. You sometimes need to use mathematical theory to prove upper and lower bounds on the order of an operation, and you may need to do some tricky summations to provide an average order estimate.

In very simple algorithms you can work it out easily, but in algorithms as sophisticated as PSO and GA, you are going to have difficulty. In fact, you will find that for GA at least, the complexity order depends upon the function being minimized (I do not know PSO well enough to know what the stopping criteria are for it.)

[nkumar]

thanks walter as you said for simpler algorithm it is easy,may i know how the answer for order of complexity will be,ant algorithm ,if i know how the output looks like ,then i start working for PSO and GA

[Walter Roberson]

I do not know the stopping conditions for the ant algorithm.

[nkumar]

extremely sorry walter ,its not ant ,its any ,just need to know how the output will be for any one algorithm which u know very well

[Walter Roberson]

There is no MATLAB routine that can undertake an order analysis; there is no possible routine that can work on all algorithms.

The matter is therefore not a MATLAB question, and should be investigated through other resources.

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

http://en.wikipedia.org/wiki/Analysis_of_algorithms#Evaluating_run-time_complexity