0 0 votes #DAA Prove that if: f(n) = amnm + am-1nm-1 + am-2nm-2 + am-3nm-3 + .........+ a1n + a0 then f(n) = O(nm) . Algorithms algorithms time-complexity asymptotic-notations + – Naveen Kumar 3 403 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
