Cody

Problem 94. Target sorting

Solution 2615635

Submitted on 26 Jun 2020 by Li Kehan Li
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

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

b = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 e = 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 d = 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 b = -4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 b = -4 -3 0 0 0 0 0 0 0 0 0 0 0 0 0 b = -4 -3 0 -2 0 0 0 0 0 0 0 0 0 0 0 b = -4 -3 0 -2 0 -1 0 0 0 0 0 0 0 0 0 b = -4 -3 0 -2 0 -1 0 0 0 0 0 0 0 0 0 b = -4 -3 0 -2 0 -1 0 0 0 1 0 0 0 0 0 b = -4 -3 0 -2 0 -1 0 0 0 1 0 2 0 0 0 b = -4 -3 0 -2 0 -1 0 0 0 1 0 2 0 3 0 b = -4 -3 0 -2 0 -1 0 0 0 1 0 2 0 3 4 b = -4 -3 0 -2 0 -1 0 0 0 1 0 2 5 3 4 b = -4 -3 0 -2 0 -1 0 0 0 1 6 2 5 3 4 b = -4 -3 0 -2 0 -1 0 0 7 1 6 2 5 3 4 b = -4 -3 0 -2 0 -1 8 0 7 1 6 2 5 3 4 b = -4 -3 0 -2 9 -1 8 0 7 1 6 2 5 3 4 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 = 0 e = 8.8584 d = 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))

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

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!