Return Besson Ranks. You can look at this article.
Besson ranking takes into account ties.
If input is
input = [1 2 2 3];
then in a regular ranking we should return
regularRanks = [1 2 3 4];
However a tie occurs at 2 and 3 in the regular ranking. So you should average their position which is (2 + 3 )/ 2 = 2.5
Finally;
bessonRankings= [1 2.5 2.5 4]
Solution Stats
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers15
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6687 Solvers
-
Remove the small words from a list of words.
1560 Solvers
-
1439 Solvers
-
16409 Solvers
-
Where is the number that you want to find?
94 Solvers
More from this Author92
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
I might be mistaken, but I think the 17th test case doesn't do anything.
Yes, it doesn't check for anything. But I'll let it be, as it is not causing any problem.