@bmtran is a too strong for me.
I think that in case 3, the correct answer should be: y_correct1 = [1 0 2 9 1 -5 2 0 11] and in case 4: y_correct0 = [1 0 1 0], or did I misunderstood the goal?
I agree with J.R.! Menzinger. Correct answers given are wrong.
No, the provided answers in the test cases are correct. This is "the difficulty" that Jean-Marie mentions above: for integers that are tied by number of occurrences, they are to be sorted within the tied subset in ascending order, not kept in the original ordering within the vector.
:(
Project Euler: Problem 9, Pythagorean numbers
305 Solvers
Longest run of consecutive numbers
1956 Solvers
Implement a bubble sort technique and output the number of swaps required
160 Solvers
583 Solvers
3271 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!