# include # include # include # include # include "matrix_chain_brute.h" int main ( ); void timestamp ( ); /******************************************************************************/ int main ( ) /******************************************************************************/ /* Purpose: matrix_chain_brute_test() tests matrix_chain_brute(). Licensing: This code is distributed under the MIT license. Modified: 27 June 2024 Author: John Burkardt */ { int cost; int *dims; int dims1[] = { 40, 20, 30, 10, 30 }; int dims2[] = { 1, 2, 3, 4, 3 }; int dims3[] = { 10, 20, 30 }; int dims4[] = { 10, 30, 5, 60 }; int dims5[] = { 10, 20 }; int dims6[] = { 40, 20, 0, 10, 30 }; int dims7[] = { 1, 100, 1, 100, 1 }; int dims8[] = { 100, 50, 1, 50, 100 }; int dims9[] = { 1, 50, 100, 50, 1 }; int dims10[] = { 4, 10, 3, 12, 20, 7 }; int i; int n_dims; int n_mats; int n_mults; int *p; int parens; int perms; int test; timestamp ( ); printf ( "\n" ); printf ( "matrix_chain_brute_test():\n" ); printf ( " C version\n" ); printf ( " Test matrix_chain_brute().\n" ); for ( test = 1; test <= 10; test++ ) { if ( test == 1 ) { n_dims = 5; dims = dims1; } else if ( test == 2 ) { n_dims = 5; dims = dims2; } else if ( test == 3 ) { n_dims = 3; dims = dims3; } else if ( test == 4 ) { n_dims = 4; dims = dims4; } else if ( test == 5 ) { n_dims = 2; dims = dims5; } else if ( test == 6 ) { n_dims = 5; dims = dims6; } else if ( test == 7 ) { n_dims = 5; dims = dims7; } else if ( test == 8 ) { n_dims = 5; dims = dims8; } else if ( test == 9 ) { n_dims = 5; dims = dims9; } else if ( test == 10 ) { n_dims = 6; dims = dims10; } n_mats = n_dims - 1; n_mults = n_mats - 1; p = ( int * ) malloc ( n_mults * sizeof ( int ) ); printf ( "\n" ); printf ( " Test #%d\n", test ); printf ( " Number of dimensions = %d\n", n_dims ); printf ( " Number of matrices = %d\n", n_mats ); printf ( " Number of multiplications = %d\n", n_mults ); printf ( " Matrix dimensions" ); for ( i = 0; i < n_dims; i++ ) { printf ( " %d", dims[i] ); } printf ( "\n" ); parens = catalan_number ( n_mults ); printf ( " Number of parenthesizations is %d\n", parens ); perms = i4_factorial ( n_mults ); printf ( " Number of possible permutations is %d\n", perms ); matrix_chain_brute ( n_mats, dims, &cost, p ); printf ( " Minimal cost is %d\n", cost ); printf ( " Multiplication order:" ); if ( n_mults < 1 ) { printf ( " [ Empty ]\n" ); } else { for ( i = 0; i < n_mults; i++ ) { printf ( " %d", p[i] ); } printf ( "\n" ); } free ( p ); } /* Terminate. */ printf ( "\n" ); printf ( "matrix_chain_brute_test():\n" ); printf ( " Normal end of execution.\n" ); printf ( "\n" ); timestamp ( ); return 0; } /******************************************************************************/ void timestamp ( ) /******************************************************************************/ /* Purpose: timestamp() prints the current YMDHMS date as a time stamp. Example: 17 June 2014 09:45:54 AM Licensing: This code is distributed under the MIT license. Modified: 01 May 2021 Author: John Burkardt */ { # define TIME_SIZE 40 static char time_buffer[TIME_SIZE]; const struct tm *tm; time_t now; now = time ( NULL ); tm = localtime ( &now ); strftime ( time_buffer, TIME_SIZE, "%d %B %Y %I:%M:%S %p", tm ); printf ( "%s\n", time_buffer ); return; # undef TIME_SIZE }