does it have something to do with memory use for efficiency in that 'in place' was developed?
sorry for the hijack...
I wasn't talking specifically about the "in place element structure", but used the term "in place" generically. If you have an array in a shift register, all operations that don't change the size (e.g. replace array subset") can be done in place, without need of new memory allocations. Whenever you resize an array (e.g. with "built array") an new memory allocation might be needed. This can be very expensive with large data structures.
This is what I had in mind with the conditional indexing.
That's something I hope to remember!
Now we are extremly happy you started trying right way.
Don't use insert array in loop , use replace array subset ( how? you find out )
for even odd use bit wise AND ( i have learnt this from altenbach )
give try again . you are on your way ...........
To get two different array. you need to fill data in two different arrays.
Now you are using the single array and filling the data in that array in both the cases
also put your array indicators outside the for loop.
and just saw why you are not getting any value at all.
Initialize the array with some value and fix length before using replace array subset
This is what I've tried after reading your instructions. Is it correct..??
Please attach the actual VI (or a snippet) instead of pictures, because we cannot tell what is in the other cases of the case structure and there is thus insufficient information to debug. If you attach pictures, crop them! (The next picture you attached contains huge amounts of whitespace).
Some comments (you are learning fast!):