1. Engineering
  2. Computer Science
  3. the number of operations executed by algorithms a and b...

Question: the number of operations executed by algorithms a and b...

Question details

The number of operations executed by algorithms A and B are 12n40nlog(n) and 5n4-100712 respectively.

Determine c and n0 such that B is greater than c*A for n>= n0

Can you provide general method and method using limits as well?

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution