Cody

# Problem 94. Target sorting

Solution 244243

Submitted on 14 May 2013 by Pawel Wojtas
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))

d = 1 1 2 2 3 3 4 4 b = 4 3 2 1 4 3 2 1 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))

d = -4.0000 7.6000 -3.0000 6.6000 -2.0000 5.6000 -1.0000 4.6000 0 3.6000 1.0000 2.6000 2.0000 1.6000 3.0000 0.6000 4.0000 0.4000 5.0000 1.4000 6.0000 2.4000 7.0000 3.4000 8.0000 4.4000 9.0000 5.4000 10.0000 6.4000 b = Columns 1 through 10 -4.0000 -3.0000 10.0000 -2.0000 9.0000 -1.0000 8.0000 0 7.0000 1.0000 7.6000 6.6000 6.4000 5.6000 5.4000 4.6000 4.4000 3.6000 3.4000 2.6000 Columns 11 through 15 6.0000 2.0000 5.0000 3.0000 4.0000 2.4000 1.6000 1.4000 0.6000 0.4000 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))

d = 12.0000 8.8584 b = 12.0000 8.8584 b = 12

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

d = -100 200 -99 199 -98 198 -97 197 -96 196 -95 195 b = -100 -99 -98 -97 -96 -95 200 199 198 197 196 195 b = -100 -99 -98 -97 -96 -95