Given n>=0, create an array length n*n with the following pattern, shown here for n=3 : {0, 0, 1, 0, 2, 1, 3, 2, 1} (spaces added to show the 3 groups). squareUp(3) → [0, 0, 1, 0, 2, 1, 3, 2, 1] squareUp(2) → [0, 1, 2, 1] squareUp(4) → [0, 0, 0, 1, 0, 0, 2, 1, 0, 3, 2, 1, 4, 3, 2, 1]
S Fox wrote:they want you to make an algorithm to form a pattern 3 * 3 = 9 element array {0, 0, 1, 0, 2, 1, 3, 2, 1} 4 * 4 = 16 element array {0,0,0,1, 0,0,2,1, 0,3,2,1, 4,3,2,1}