Considérons l’algorithme suivant : def algorithm_D (m, n) : i = 1 ...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Considérons l’algorithme suivant :
def algorithm_D(m, n): i =
1 j =
1
while (j <= n):
if i <= m:
i = i +
1
else:
j = j +
1 i =
1Quelle est la complexité temporelle de cet algorithme, sachant que n et m sont strictement positif ?
Want instant access to all verified answers on moodle.esme.fr?
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!