PartIsPerfect: Check if the partition is perfect.
In arnaud-m/partition: Race to Solve the Partition Problem

A partition is perfect if the difference between the sum of integers of S1 and S2 is equal to 0 (resp. 1) for a even (resp. odd) set.

1	PartIsPerfect(sizes, part)

`sizes`	a numeric vector which represents the integers (>0) in the set S.
`part`	a logical vector which represents the indicator function of S1 in the partition S=S1+S2.

true if the partition is perfect.

1 2	PartIsPerfect(seq(4), c(FALSE,TRUE,TRUE,FALSE)) PartIsPerfect(seq(4), c(TRUE,TRUE,TRUE,FALSE))

arnaud-m/partition documentation built on May 10, 2019, 1:44 p.m.

arnaud-m/partition index

rdrr.io home R language documentation Run R code online

Note that we can't provide technical support on individual packages. You should contact the package authors for that.

Description