You are viewing a single comment's thread from:
RE: SLC21 Week6 - Programming Games&Puzzles (part 2)
Hey @sergeyk, got a question for the third task. You want us to find 5 ways to fill an array from 1 to N and always have the numbers sorted 1,2,3,...,N and only the filling way to be different?
or 5 ways to fill with numbers from 1 to N but in any order as long as we keep each value unique?
I guess it's the second one but wanted to make sure.
yes, this is your second option
1..6 => {4,1,5,2,6,3} or {4,1,5,2,0,3}
many construction methods should be demonstrated - from the worst to the best