Cody

Problem 94. Target sorting

Solution 1797797

Submitted on 26 Apr 2019 by Rajpurohith Urmila
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))

m = 1 2 3 4 p = 4 3 2 1 q = 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))

m = 7.6000 6.6000 5.6000 4.6000 3.6000 2.6000 1.6000 0.6000 0.4000 1.4000 2.4000 3.4000 4.4000 5.4000 6.4000 p = 7.6000 6.6000 6.4000 5.6000 5.4000 4.6000 4.4000 3.6000 3.4000 2.6000 2.4000 1.6000 1.4000 0.6000 0.4000 q = 1 2 15 3 14 4 13 5 12 6 11 7 10 8 9

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

m = 8.8584 p = 8.8584 q = 1

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

m = 200 199 198 197 196 195 p = 200 199 198 197 196 195 q = 1 2 3 4 5 6