Mathematically proof for Big-O related topic
Budget: $10 – $11 CAD
I need a clear proof for below equation:
O(n^k)+O(n^m)=O(N^m) m>k>0
Using Big-O formal definition.
FIXED PRICE=10CAD
I have to pay the site charge like you. OK?
O(n^k)+O(n^m)=O(N^m) m>k>0
Using Big-O formal definition.
FIXED PRICE=10CAD
I have to pay the site charge like you. OK?