Problem 1920. Find the position of first minimum value in an integer array with numbers

Solution 1250811

Submitted on 13 Aug 2017 by yurenchu

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test	Status	Code Input and Output
1	Pass	x = [2 6 4 9 10 3 1 5]; y_correct = 7; assert(isequal(min_fpos(x),y_correct))
2	Pass	x = [2 6 -4 9 10 3 -1 5]; y_correct = 3; assert(isequal(min_fpos(x),y_correct))
3	Pass	x = [-4 6 -4 9 10 3 -1 5]; y_correct = 1; assert(isequal(min_fpos(x),y_correct))
4	Pass	x = [0 6 0 9 -10 3 -1 5]; y_correct = 5; assert(isequal(min_fpos(x),y_correct))