Cody

Problem 11. Back and Forth Rows

Solution 403888

Submitted on 13 Feb 2014 by Joyce
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.

Solve This Problem View on Solution Map

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)));

st = 1 last = 4 A = 1 2 3 4 b = 1 2 3 4 st = 5 last = 8 A = 5 6 7 8 b = 1 2 3 4 5 6 7 8 b = 1 2 3 4 8 7 6 5 st = 9 last = 12 A = 9 10 11 12 b = 1 2 3 4 8 7 6 5 9 10 11 12 st = 13 last = 16 A = 13 14 15 16 b = 1 2 3 4 8 7 6 5 9 10 11 12 13 14 15 16 b = 1 2 3 4 8 7 6 5 9 10 11 12 16 15 14 13 st = 17

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)));

st = 1 last = 5 A = 1 2 3 4 5 b = 1 2 3 4 5 st = 6 last = 10 A = 6 7 8 9 10 b = 1 2 3 4 5 6 7 8 9 10 b = 1 2 3 4 5 10 9 8 7 6 st = 11 last = 15 A = 11 12 13 14 15 b = 1 2 3 4 5 10 9 8 7 6 11 12 13 14 15 st = 16 last = 20 A = 16 17 18 19 20 b = 1 2 3 4 5 10 9 8 7 6 11 12 13 14 15 16 17 18 19 20 b = 1 2 3 4 5 10 9 8 7 6 11 12 13 14 15 20 19 18 17 16 st = 21 last = 25 A = 21 22 23 24 25 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 st = 26

Suggested Problems

More from this Author95

Community Treasure Hunt

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

Start Hunting!