Cody

# Problem 94. Target sorting

Solution 2097411

Submitted on 18 Jan 2020 by Matej Pulec
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
a = [1 2 3 4]; t = 0; b_correct = [4 3 2 1]; assert(isequal(targetSort(a,t),b_correct))

b = 4 b = 4 3 b = 4 3 2 b = 4 3 2 1

2   Pass
a = -4:10; t = 3.6; b_correct = [-4 -3 10 -2 9 -1 8 0 7 1 6 2 5 3 4]; assert(isequal(targetSort(a,t),b_correct))

b = -4 b = -4 -3 b = -4 -3 10 b = -4 -3 10 -2 b = -4 -3 10 -2 9 b = -4 -3 10 -2 9 -1 b = -4 -3 10 -2 9 -1 8 b = -4 -3 10 -2 9 -1 8 0 b = -4 -3 10 -2 9 -1 8 0 7 b = -4 -3 10 -2 9 -1 8 0 7 1 b = -4 -3 10 -2 9 -1 8 0 7 1 6 b = -4 -3 10 -2 9 -1 8 0 7 1 6 2 b = -4 -3 10 -2 9 -1 8 0 7 1 6 2 5 b = -4 -3 10 -2 9 -1 8 0 7 1 6 2 5 3 b = -4 -3 10 -2 9 -1 8 0 7 1 6 2 5 3 4

3   Pass
a = 12; t = pi; b_correct = 12; assert(isequal(targetSort(a,t),b_correct))

b = 12

4   Pass
a = -100:-95; t = 100; b_correct = [-100 -99 -98 -97 -96 -95]; assert(isequal(targetSort(a,t),b_correct))

b = -100 b = -100 -99 b = -100 -99 -98 b = -100 -99 -98 -97 b = -100 -99 -98 -97 -96 b = -100 -99 -98 -97 -96 -95