ni.com is currently undergoing scheduled maintenance.
Some services may be unavailable at this time. Please contact us for help or try again later.
LabVIEW
How can I remove repeated elements in an array
just for the sake of different solution
ofcourse valid only for positive numbers in array.
Christian, Is it fast?????
OK Christian,
I think i got your point. ( i never thought that way ):smileysurprised:
Now i have one more idea, if i can insert 1 array subset function with index zero and length of array from lower shift register. That will only give me any array of limited elements so limited comparison but i will end up with an extra copy of array for array subset.
Am I right ?
So still not fast
@altenbach wrote:
@Neos wrote:
one more attempt
This is getting better, however if the sorted input array starts with a zero, the output would be wrong. Right?
No, I edited my reply, use -1 in place on 0.
You can also save some array buffer allocations.
Where am i missing??
Also note that this idea would make things a bit simpler. 😄
Kudoed
Anyway, since you are getting close, here's my benchmark I wrote earlier, compairing 4 different code versions. Mine is pretty standard code and I suspect that the openG version is similar (not checked, because I don't have it). The main technique has been discussed many times in the past (e.g. here is my post from 2005).
Attached version is in labVIEW 2013, but I also attached a LabVIEW 9 version. Do you need older?
Neos wrote:
No, I edited my reply, use -1 in place on 0.
Then you will have a problem if the sorted array starts with -1. 😉
Neos wrote:
Where am i missing??
Note that you need two full sized arrays (1) the sorted array, (2) the initialized array.
If you look at my code, you will notice that I place the sorted array directly into the shift register. Since we always read from the unmodified section, there is no problem operating only on one single array.
