Haw to find element in array which occurs only once

[MoReese]

I thought it better to search the whole range +/-.  This will make his VI more flexible rather than fixing it to a specific range.

[pawhan11]

I don't know for what elements will I look for. Range 1-9 was just example. All I know about numbers is that they are integers from 0 to 2000 or more.

So I think good way to handle that is to find Max and min value in array and then search and increment by 1

[MoReese]

Were you able to open my .zip file?  This should work per your spec.  The only thing I forgot to include was the position of the element in the array, but with some modifications you should be able to do that.  You did not mention Max/Min in your ealier posts, but Max/Min should not matter, at least it doesn't with my VI.  It will simply return the single instances found in a 2D array.

[Omar_II]

---

@pawhan11 wrote:

I don't know for what elements will I look for. Range 1-9 was just example. All I know about numbers is that they are integers from 0 to 2000 or more.

So I think good way to handle that is to find Max and min value in array and then search and increment by 1

---

How big is the input array going to be? Greater than 2000?

It might be better to increment through a 1D copy of the input array check each index to the rest of the array for matches.

Than to check for all possible values (2000+)