matrix isn×n, then the product requires 2n3flops, and is anO(n3) algorithm. If two matrices are 500×500, their product requires 2.5×108flops. Fortunately, when matrices in applications become that large, they are usually sparse, meaning there is a low percentage ofnonzero entries. There...