文件名称:juzhengxiangjia
介绍说明－－下载内容均来自于网络，请自行研究使用
5.22④ 假设系数矩阵A和B均以三元组表作为存储结构。
试写出满足以下条件的矩阵相加的算法：假设三元组表A
的空间足够大，将矩阵B加到矩阵A上，不增加A、B之外
的附加空间，你的算法能否达到O(m+n)的时间复杂度?其
中m和n分别为A、B矩阵中非零元的数目。-5.22 ④ assumptions coefficient matrix A and B are in three groups, as the storage structure. Try to write the following conditions are met the matrix sum of the algorithm: Suppose Table A triple room is large enough, will be added to the matrix A matrix B, not to increase A, B in addition to space, your algorithm can achieve O (m+ n) time complexity? which m and n, respectively, for A, B matrix in the number of non-zero element.
试写出满足以下条件的矩阵相加的算法：假设三元组表A
的空间足够大，将矩阵B加到矩阵A上，不增加A、B之外
的附加空间，你的算法能否达到O(m+n)的时间复杂度?其
中m和n分别为A、B矩阵中非零元的数目。-5.22 ④ assumptions coefficient matrix A and B are in three groups, as the storage structure. Try to write the following conditions are met the matrix sum of the algorithm: Suppose Table A triple room is large enough, will be added to the matrix A matrix B, not to increase A, B in addition to space, your algorithm can achieve O (m+ n) time complexity? which m and n, respectively, for A, B matrix in the number of non-zero element.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
新建 Microsoft Word 文档.doc