Fastest way to compute C(i,j)=max(A(i,j),B(i,j))

[lordsathish]

Hi Ppl,

I just wanted to know, what could be the fastest way to pick the maximum element from a 2D array .

That is i want to implement C(i,j)=max(A(i,j),B(i,j))

I do not want to index each element and select the maximum of two, as it would take more time to execute.

I tried the below method to implement this. The problem with this is, when a NaN is passed as input, NaN is returned

as output, irrespective of the other input. I don not want this to happen.

Can any one suggest a better method to implement this...? 

[tst · Accepted solution]

Use the Max and Min primitive from the comparison palette. It accepts arrays and will even ignore NaN.

[AdnanZ]

Use the Max & Min function node. Not really sure of what the O(n) of that function is.

[Henrik_Volkers]

However the max/min of (NaN, NaN) ist still NaN !

So you still have to look for that case 😉

[lordsathish]

Hi Ppl,

What makes such a difference in the execution speed, when we use a function from LabVIEW and use our own VI.

Is it that these functions are precompiled makes such a difference, or that they are done efficiently ?

I guess both should be the reason that they their execution times are less.

Thanks