Cody

# Problem 11. Back and Forth Rows

Solution 512650

Submitted on 14 Oct 2014 by gaurav parihar
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

This solution is outdated. To rescore this solution, sign in.

### Test Suite

Test Status Code Input and Output
1   Pass
n = 4; a = [ 1 2 3 4; 8 7 6 5; 9 10 11 12; 16 15 14 13]; assert(isequal(a,back_and_forth(n)));

c = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m = 1 c = 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m = 1 c = 1 2 3 1 1 1 1 1 1 1 1 1 1 1 1 1 m = 1 c = 1 2 3 4 1 1 1 1 1 1 1 1 1 1 1 1 m = 1 c = 1 2 3 4 1 1 1 5 1 1 1 1 1 1 1 1 m = 0 c = 1 2 3 4 1 1 6 5 1 1 1 1 1 1 1 1 m = 0 c = 1 2 3 4 1 7 6 5 1 1 1 1 1 1 1 1 m = 0 c = 1 2 3 4 8 7 6 5 1 1 1 1 1 1 1 1 m = 0 c = 1 2 3 4 8 7 6 5 9 1 1 1 1 1 1 1 m = 1 c = 1 2 3 4 8 7 6 5 9 10 1 1 1 1 1 1 m = 1 c = 1 2 3 4 8 7 6 5 9 10 11 1 1 1 1 1 m = 1 c = 1 2 3 4 8 7 6 5 9 10 11 12 1 1 1 1 m = 1 c = 1 2 3 4 8 7 6 5 9 10 11 12 1 1 1 13 m = 0 c = 1 2 3 4 8 7 6 5 9 10 11 12 1 1 14 13 m = 0 c = 1 2 3 4 8 7 6 5 9 10 11 12 1 15 14 13 m = 0 c = 1 2 3 4 8 7 6 5 9 10 11 12 16 15 14 13 m = 0 b = 1 2 3 4 8 7 6 5 9 10 11 12 16 15 14 13

2   Pass
%% n = 5; a = [ 1 2 3 4 5; 10 9 8 7 6; 11 12 13 14 15; 20 19 18 17 16; 21 22 23 24 25]; assert(isequal(a,back_and_forth(n)));

c = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m = 1 c = 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m = 1 c = 1 2 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m = 1 c = 1 2 3 4 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m = 1 c = 1 2 3 4 5 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m = 1 c = 1 2 3 4 5 1 1 1 1 6 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m = 0 c = 1 2 3 4 5 1 1 1 7 6 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m = 0 c = 1 2 3 4 5 1 1 8 7 6 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m = 0 c = 1 2 3 4 5 1 9 8 7 6 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m = 0 c = 1 2 3 4 5 10 9 8 7 6 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m = 0 c = 1 2 3 4 5 10 9 8 7 6 11 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m = 1 c = 1 2 3 4 5 10 9 8 7 6 11 12 1 1 1 1 1 1 1 1 1 1 1 1 1 m = 1 c = 1 2 3 4 5 10 9 8 7 6 11 12 13 1 1 1 1 1 1 1 1 1 1 1 1 m = 1 c = 1 2 3 4 5 10 9 8 7 6 11 12 13 14 1 1 1 1 1 1 1 1 1 1 1 m = 1 c = 1 2 3 4 5 10 9 8 7 6 11 12 13 14 15 1 1 1 1 1 1 1 1 1 1 m = 1 c = 1 2 3 4 5 10 9 8 7 6 11 12 13 14 15 1 1 1 1 16 1 1 1 1 1 m = 0 c = 1 2 3 4 5 10 9 8 7 6 11 12 13 14 15 1 1 1 17 16 1 1 1 1 1 m = 0 c = 1 2 3 4 5 10 9 8 7 6 11 12 13 14 15 1 1 18 17 16 1 1 1 1 1 m = 0 c = 1 2 3 4 5 10 9 8 7 6 11 12 13 14 15 1 19 18 17 16 1 1 1 1 1 m = 0 c = 1 2 3 4 5 10 9 8 7 6 11 12 13 14 15 20 19 18 17 16 1 1 1 1 1 m = 0 c = 1 2 3 4 5 10 9 8 7 6 11 12 13 14 15 20 19 18 17 16 21 1 1 1 1 m = 1 c = 1 2 3 4 5 10 9 8 7 6 11 12 13 14 15 20 19 18 17 16 21 22 1 1 1 m = 1 c = 1 2 3 4 5 10 9 8 7 6 11 12 13 14 15 20 19 18 17 16 21 22 23 1 1 m = 1 c = 1 2 3 4 5 10 9 8 7 6 11 12 13 14 15 20 19 18 17 16 21 22 23 24 1 m = 1 c = 1 2 3 4 5 10 9 8 7 6 11 12 13 14 15 20 19 18 17 16 21 22 23 24 25 m = 1 b = 1 2 3 4 5 10 9 8 7 6 11 12 13 14 15 20 19 18 17 16 21 22 23 24 25

### Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!