Cody

Problem 1927. Find nth maximum

Solution 2821857

Submitted on 12 Aug 2020 by Yin-Lung Wong
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
x = [2 6 4 9 -10 3 1 5 -10]; y_correct = 5; assert(isequaln(n_max(x,3),y_correct))

z = 2 6 4 9 -10 3 1 5 -10 other = [] MAX = 9 temp = 4 other = 9 z = 2 6 4 -10 3 1 5 -10 MAX = 6 temp = 2 other = 9 6 z = 2 4 -10 3 1 5 -10 MAX = 5 temp = 6 other = 9 6 5 z = 2 4 -10 3 1 -10 MAX = 4 temp = 2 other = 9 6 5 4 z = 2 -10 3 1 -10 MAX = 3 temp = 3 other = 9 6 5 4 3 z = 2 -10 1 -10 MAX = 2 temp = 1 other = 9 6 5 4 3 2 z = -10 1 -10 MAX = 1 temp = 2 other = 9 6 5 4 3 2 1 z = -10 -10 MAX = -10 temp = 1 2 other = 9 6 5 4 3 2 1 -10 z = -10 MAX = -10 temp = 1 other = 9 6 5 4 3 2 1 -10 -10 z = 1×0 empty double row vector y = 5

2   Pass
x = [2 6 4 9 -10 3 1 5 -10]; y_correct = NaN; assert(isequaln(n_max(x,13),y_correct))

y = NaN

3   Pass
x = [0 0 0 -2 0 -6]; y_correct = -2; assert(isequaln(n_max(x,5),y_correct))

z = 0 0 0 -2 0 -6 other = [] MAX = 0 temp = 1 2 3 5 other = 0 z = 0 0 -2 0 -6 MAX = 0 temp = 1 2 4 other = 0 0 z = 0 -2 0 -6 MAX = 0 temp = 1 3 other = 0 0 0 z = -2 0 -6 MAX = 0 temp = 2 other = 0 0 0 0 z = -2 -6 MAX = -2 temp = 1 other = 0 0 0 0 -2 z = -6 MAX = -6 temp = 1 other = 0 0 0 0 -2 -6 z = 1×0 empty double row vector y = -2

4   Pass
x = [1 1 1 1 1 1]; y_correct = 1; assert(isequaln(n_max(x,4),y_correct))

z = 1 1 1 1 1 1 other = [] MAX = 1 temp = 1 2 3 4 5 6 other = 1 z = 1 1 1 1 1 MAX = 1 temp = 1 2 3 4 5 other = 1 1 z = 1 1 1 1 MAX = 1 temp = 1 2 3 4 other = 1 1 1 z = 1 1 1 MAX = 1 temp = 1 2 3 other = 1 1 1 1 z = 1 1 MAX = 1 temp = 1 2 other = 1 1 1 1 1 z = 1 MAX = 1 temp = 1 other = 1 1 1 1 1 1 z = 1×0 empty double row vector y = 1

5   Pass
x = [1 1 1 1 1 1]; y_correct = NaN; assert(isequaln(n_max(x,14),y_correct))

y = NaN

Suggested Problems

More from this Author2

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!