06 October 2025 6:51:33.715 PM test_partial_digest_test(): Fortran90 version. Test test_partial_digest(). 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 139 2 141 3 134 4 52 5 170 6 -67 7 37 8 121 9 112 10 49 11 -47 12 -85 13 -73 14 -84 15 -52 16 61 17 32 18 122 19 17 20 117 I4VEC_DISTANCES_TEST I4VEC_DISTANCES computes the pairwise distances between elements of an I4VEC. Locations: 1 0 2 3 3 10 4 20 5 100 Distances: 1 3 2 10 3 20 4 100 5 7 6 17 7 97 8 10 9 90 10 80 I4VEC_HEAP_D_TEST For an I4VEC, I4VEC_HEAP_D puts into descending heap form. Unsorted array: 1 0 2 3 3 10 4 9 5 6 6 3 7 10 8 7 9 3 10 10 Descending heap form: 1 10 2 9 3 10 4 7 5 6 6 3 7 10 8 0 9 3 10 3 I4VEC_PRINT_TEST I4VEC_PRINT prints an I4VEC The I4VEC: 1 91 2 92 3 93 4 94 I4VEC_SORT_HEAP_A_TEST I4VEC_SORT_HEAP_A ascending sorts an I4VEC, Unsorted: 1 12 2 5 3 6 4 56 5 21 6 60 7 49 8 44 9 16 10 42 11 60 12 57 13 36 14 39 15 19 16 38 17 5 18 46 19 0 20 56 Ascending sorted: 1 0 2 5 3 5 4 6 5 12 6 16 7 19 8 21 9 36 10 38 11 39 12 42 13 44 14 46 15 49 16 56 17 56 18 57 19 60 20 60 KSUB_RANDOM_TEST KSUB_RANDOM generates a random K subset of an N set. Set size is N = 5 Subset size is K = 3 3 4 2 3 4 1 5 2 4 5 2 1 4 3 2 4 5 1 3 4 1 4 3 2 3 2 4 1 2 3 example_partial_digest_test: TEST_PARTIAL_DIGEST creates test problems for the partial digest problem. Number of nodes = 6 Maximum distance = 20 Locations: 1 0 2 1 3 3 4 16 5 17 6 20 Distances: 1 1 2 1 3 2 4 3 5 3 6 4 7 13 8 14 9 15 10 16 11 16 12 17 13 17 14 19 15 20 TEST_PARTIAL_DIGEST_TEST: Normal end of execution. 06 October 2025 6:51:33.715 PM