1. Engineering
  2. Computer Science
  3. the analysing time complexity question...

Question: the analysing time complexity question...

Question details

the Analysing time complexity question

(5 marks) Processing time T(n) of a certain algorithm is ?(n) and O (ms). Decide whether these bounds imply the conclusion that T(n) is e (m2) and justify your decision.

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