Tue May 20 22:21:57 2025

partition_brute_test():
  python version: 3.10.12
  numpy version:  1.26.4
  Test partition_brute().

partition_brute_test01():
  partition_brute() seeks a balanced partition using brute force.
  Partition a set of N integers W so that the subsets
  have equal sums.

     I        W0        W1

     0                  19
     1        17
     2                  13
     3         9
     4         6
        --------  --------
              32        32

  Discrepancy = 0

partition_brute_test01():
  partition_brute() seeks a balanced partition using brute force.
  Partition a set of N integers W so that the subsets
  have equal sums.

     I        W0        W1

     0                 484
     1                 114
     2                 205
     3                 288
     4       506
     5       503
     6                 201
     7                 127
     8       410
        --------  --------
            1419      1419

  Discrepancy = 0

partition_brute_test01():
  partition_brute() seeks a balanced partition using brute force.
  Partition a set of N integers W so that the subsets
  have equal sums.

     I        W0        W1

     0                 771
     1       121
     2                 281
     3                 854
     4       885
     5                 734
     6       486
     7      1003
     8        83
     9        62
        --------  --------
            2640      2640

  Discrepancy = 0

partition_brute_test01():
  partition_brute() seeks a balanced partition using brute force.
  Partition a set of N integers W so that the subsets
  have equal sums.

     I        W0        W1

     0                   2
     1                  10
     2                   3
     3         8
     4                   5
     5                   7
     6         9
     7         5
     8         3
     9         2
        --------  --------
              27        27

  Discrepancy = 0

partition_brute_test01():
  partition_brute() seeks a balanced partition using brute force.
  Partition a set of N integers W so that the subsets
  have equal sums.

     I        W0        W1

     0                   3
     1                   4
     2                   3
     3                   1
     4         3
     5         2
     6         3
     7         2
     8         1
        --------  --------
              11        11

  Discrepancy = 0

partition_brute_test01():
  partition_brute() seeks a balanced partition using brute force.
  Partition a set of N integers W so that the subsets
  have equal sums.

     I        W0        W1

     0                   8
     1                   7
     2         6
     3         5
     4         4
        --------  --------
              15        15

  Discrepancy = 0

partition_count_test():
  partition_count() counts the number of exact solutions
  of the partition problem.

     I        W

     0        19
     1        17
     2        13
     3         9
     4         6

  Number of solutions = 2

partition_count_test():
  partition_count() counts the number of exact solutions
  of the partition problem.

     I        W

     0       484
     1       114
     2       205
     3       288
     4       506
     5       503
     6       201
     7       127
     8       410

  Number of solutions = 2

partition_count_test():
  partition_count() counts the number of exact solutions
  of the partition problem.

     I        W

     0       771
     1       121
     2       281
     3       854
     4       885
     5       734
     6       486
     7      1003
     8        83
     9        62

  Number of solutions = 2

partition_count_test():
  partition_count() counts the number of exact solutions
  of the partition problem.

     I        W

     0         2
     1        10
     2         3
     3         8
     4         5
     5         7
     6         9
     7         5
     8         3
     9         2

  Number of solutions = 46

partition_count_test():
  partition_count() counts the number of exact solutions
  of the partition problem.

     I        W

     0         3
     1         4
     2         3
     3         1
     4         3
     5         2
     6         3
     7         2
     8         1

  Number of solutions = 48

partition_count_test():
  partition_count() counts the number of exact solutions
  of the partition problem.

     I        W

     0         8
     1         7
     2         6
     3         5
     4         4

  Number of solutions = 2

subset_next_test():
  subset_next() generates all subsets of an N set.

  (empty set)

  4

  3

  3
  4

  2

  2
  4

  2
  3

  2
  3
  4

  1

  1
  4

  1
  3

  1
  3
  4

  1
  2

  1
  2
  4

  1
  2
  3

  1
  2
  3
  4

  0

  0
  4

  0
  3

  0
  3
  4

  0
  2

  0
  2
  4

  0
  2
  3

  0
  2
  3
  4

  0
  1

  0
  1
  4

  0
  1
  3

  0
  1
  3
  4

  0
  1
  2

  0
  1
  2
  4

  0
  1
  2
  3

  0
  1
  2
  3
  4


partition_brute_test():
  Normal end of execution.
Tue May 20 22:21:57 2025