Jump to content

Recommended Posts

Posted

 

Show that f1(n)+f2(n)= o(m4*(g1(n),g2(n)) where f1(n)= o(g1(n)) and f2(n)=o(g2(n))?

o is small o asymptotic notation and question is related to time complexity
Guest
This topic is now closed to further replies.
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.