how can I make the code generating all the possible combinations of integer numbers more efficient

1 次查看（过去 30 天）
Hugo
Hugo 2022-1-27
回答： Benjamin Thompson 2022-1-27
Hi,
I would like to know how I can modify the following code, as to make it more efficient. This code writes the matrix total, which has all the possible combinations of 4 and 5 numbers, considering all the integer numbers from 1 to 10. I thank you in advance.
v = 1:1:10;
sens5 = nchoosek(v,5)
sens5(:,6)=0
sens5(:,7)=0
sens5(:,8)=0
sens5(:,9)=0
sens5(:,10)=
sens4 = nchoosek(v,4)
sens4(:,5)=0
sens4(:,6)=0
sens4(:,7)=0
sens4(:,8)=0
sens4(:,9)=0
sens4(:,10)=0
total=[sens4; sens5]

请先登录，再回答此问题。

采纳的回答

Benjamin Thompson
Benjamin Thompson 2022-1-27
This runs very fast. But if you are scaling up to a bigger problem, you can probably precompute the value of the factorial operation, just look at the mathematical definition of nchoosek. Then if you are sequentially calculating nchoosek with increasing n, the math of calculating it for n+1 can be done using the previous nchoosek.
There is also parfor, or see if nchoosek can be run on a GPU with a gpuArray input if you have a good GPU.

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Number Theory 的更多信息

标签

产品


版本

R2021a

Community Treasure Hunt

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

Start Hunting!

Translated by