08-28-2012 12:04 PM - edited 08-28-2012 12:09 PM
I have four 1D arrays (each about 80 elements long) stored in slightly different places in a 'super-cluster' (the most relevant levels can be seen in the picture below). I need to find the value of the highest element in these arrays. I've come up with a couple of methods but it's getting late in the day and they all seem depressingly convoluted. What's the best/fastest way to do this? In a comparable example, I will also need to find the lowest element of four different arrays.
Solved! Go to Solution.
08-28-2012 12:09 PM
08-28-2012 12:17 PM
I did consider that, but then convinced myself that creating a higher-level array just to find my answer was going a bit over the top! Or does it not really matter in this case?
08-28-2012 12:24 PM
I'd say, in this case, the simpler the better. Just use Build Array and use the Array Max & Min. The other solution I would consider would be to use the Array Max & Min on each of the arrays, and then build an array of the maxes and use the Array Max & Min again. But this sounds convoluted and probably a lot slower than just building a big array.
08-28-2012 12:27 PM
08-28-2012 12:29 PM
Okay, thank you. You can probably tell I didn't have a relaxing weekend! (so tired)