So the question:
under what circumstances is a function f(n) said to be O(g(n))?
My Answer:
When f(n) contains a nested for loop iterating of n?
Is this at all on the right track?
Aucun commentaire:
Enregistrer un commentaire