Given in input the maximum degree P, the algorithm furnishes a ordered list of two dimensional vectors [i,j] i,j>=0 such that i+j<=P-1
P=2 indexes=[0,0;1,0;0,1]
P=3 indexes=[0,0;1,0;0,1;2,0;1,1;0,2]
Solution Stats
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers18
Suggested Problems
-
Maximum running product for a string of numbers
2257 Solvers
-
Project Euler: Problem 7, Nth prime
1775 Solvers
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
520 Solvers
-
5893 Solvers
-
Replace every 3rd element in a vector with 4
267 Solvers
More from this Author2
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
The indexes must follow a cantor-like order for some reason, and this zig-zag should probably be added to the problem description.
What exactly do you mean by an ordered pair? Specify it in the problem description.