Introduction - If you have any usage issues, please Google them yourself
best matrix continually multiply given n matrix (A1, A2, ... An), Ai and A is a mere i, i = 1, 2 ..., n-1. N explore the link matrix product ... An A1A2. Matrices A and B can either condition is out of the matrix A few matrix B is the number of rows. If A is a p q matrix B is a q-r-matrix, its product C = AB is a p r matrix, the number required by pqr. Because matrix multiplication meet the law of combination, it's even calculated matrix product can be calculated in many different priorities. For example, the matrix-based 3 (A1, A2, A3) dimension of 10 100, 100 5 5 and 50. If bracketed by the way ((A1A2) A3), even three product matrix multiplication in the number of 10 100 10 5 50 = 7,500. If bracketed by the way (A1 (A2A3)), three matrix product even need a total of 10 5 50
Packet : 337531242005102611013310480.rar filelist
DynamicProgramming\head\DynamicProgramming.h
DynamicProgramming\head\Global.h
DynamicProgramming\head\Matrix.h
DynamicProgramming\head
DynamicProgramming\src\DynamicProgramming.c
DynamicProgramming\src\Global.c
DynamicProgramming\src\main.c
DynamicProgramming\src\Matrix.c
DynamicProgramming\src
DynamicProgramming\test\DynamicProgrammingTest.c
DynamicProgramming\test\DynamicProgrammingTest.h
DynamicProgramming\test
DynamicProgramming