08 October 2022 05:39:55 PM

partial_digest_test():
  C version
  Test partial_digest().

find_distances_test():
  find_distances() takes a candidate location Y
  and determines whether its distance to each point
  in the X array is listed in the L array.

  Initial L array:

         0:       13
         1:       15
         2:       38
         3:       90
         4:        2
         5:       25
         6:       77
         7:       23
         8:       75
         9:       52

  Consider Y = 77

  This Y is acceptable.

  New X array:

         0:        0
         1:       90
         2:       77

  New L array:

         0:       52
         1:       15
         2:        2
         3:       25
         4:       38
         5:       23
         6:       75

  Consider Y = 35

  This Y is not acceptable.

i4_uniform_ab_test():
  i4_uniform_ab() computes pseudorandom values
  in an interval [A,B].

  The lower endpoint A = -100
  The upper endpoint B = 200

         1      -100
         2      -100
         3       -88
         4       -47
         5         9
         6       -73
         7       -73
         8        46
         9        58
        10        36
        11       -30
        12       150
        13       180
        14        70
        15        67
        16       -85
        17       130
        18       -95
        19       -25
        20       -11

i4vec_max_last_test():
  i4vec_max_last() identifies the largest element in an
  I4VEC, and moves it to the final entry.

  Input vector:

         0:       27
         1:       16
         2:       28
         3:       16
         4:       25
         5:        6
         6:       27
         7:       18
         8:        3
         9:       25

  Maximum: = 28

  Output vector:

         0:       16
         1:       27
         2:       16
         3:       25
         4:        6
         5:       27
         6:       18
         7:        3
         8:       25
         9:       28

i4vec_print_test():
  i4vec_print() prints an I4VEC

  Here is the I4VEC:

         0:       91
         1:       92
         2:       93
         3:       94

partial_digest_recur_test01():
  partial_digest_recur() generates solutions to the partial
  digest problem, using recursion

  The number of objects to place is N = 5

  The original placement was 0,3,6,8,10.
  These placements generate the following distances:

  Distance array:

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

  partial_digest_recur() may recover the original placements
  from the pairwise distances.  It may also find other
  placements that have the same distance array.

  Solution:

         0:        0
         1:       10
         2:        8
         3:        3
         4:        6

  Solution:

         0:        0
         1:       10
         2:        2
         3:        7
         4:        4

partial_digest_test():
  Normal end of execution.

08 October 2022 05:39:55 PM