Cody

# Problem 94. Target sorting

Solution 1684578

Submitted on 1 Dec 2018 by Anna Di Gialleonardo
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))

n = 1 x = 4 n = 1 x = 3 n = 1 x = 2 n = 1 x = 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))

n = 1 x = 1 n = 1 x = 2 n = 1 x = 15 n = 1 x = 3 n = 1 x = 14 n = 1 x = 4 n = 1 x = 13 n = 1 x = 5 n = 1 x = 12 n = 1 x = 6 n = 1 x = 11 n = 1 x = 7 n = 1 x = 10 n = 1 x = 8 n = 1 x = 9

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

n = 1 x = 1

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

n = 1 x = 1 n = 1 x = 2 n = 1 x = 3 n = 1 x = 4 n = 1 x = 5 n = 1 x = 6