Try the attached vi. If you can't read the file then here is a description
1. Reverse the array and get the array length 2. Search the reversed array for the first zero 3. Subtract this number from the array length 4. Use this number to split the original array 5. Take the two new array and concatenate them in reverse order.
If you always have 3 leading zeroes, just use "rotate array" with n = -3.
If you have a variable amount of leading zeroes and want to programmatically determine how much to rotate to get the first nonzero number at the beginning, use something like the simple code attached.
@rpursley8 wrote: 2. Search the reversed array for the first zero
Randall, You are making the assumption that ALL elements after the first nonzero element are always nonzero. For example an input of 0,0,0,2,3,0,5 to your code would yield 5,0,0,0,2,3,0 which is probably not as intended. My code results in 2,3,0,5,0,0,0 for this case, which seems more reasonable.