25 views (last 30 days)

Show older comments

sharifah shuthairah syed abdullah
on 3 Jul 2018

Commented: sharifah shuthairah syed abdullah
on 4 Jul 2018

OCDER
on 3 Jul 2018

I think you need to make your own function of perms, but one that only returns 1 of many permutations at a time. When you past n = 10, you'll run out of memory fast.

3.5 GB n = 11

46.0 GB n = 12

647.6 GB n = 13

9764.0 GB n = 14

One suggestion is to make a classdef object that track the ith permutation and will continuously return the the next permutation. But read this link as your attempt to compute permutations for n >> 11 gets fairly impossible...

Stephen Cobeldick
on 3 Jul 2018

One option would be to use a permutation generator, which does not store all permutations in memory:

etc.

I leave it up to the reader to decide if running through all permutations is tractable or not.

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

Start Hunting!