Crowdly
Add to Chrome
[25-26] Algorithmique avancée 2 [S3] [SPE]
Looking for [25-26] Algorithmique avancée 2 [S3] [SPE] test answers and solutions? Browse our comprehensive collection of verified answers for [25-26] Algorithmique avancée 2 [S3] [SPE] at moodle.esme.fr.
Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!
Consider the following algorithm:
def algorithm_D(m, n): i =
1 j =
1
while (j <= n):
if i <= m:
i = i +
1
else:
j = j +
1 i =
1What is the time complexity of this algorithm?
Consider the following algorithm:
def algorithm_C(m, n): i =
1 j =
1
while (j <= n):
if i <= m:
i = i +
1
else:
j = j +
1What is the time complexity of this algorithm?
Consider the following algorithm:
def algorithm_B(m, n): i =
1 j =
1
while (i <= m) or (j <= n):
i = i +
1 j = j +
1What is the time complexity of this algorithm?
Consider the following algorithm:
def algorithm_A(m, n): i =
1 j =
1
while (i <= m) and (j <= n):
i = i +
1 j = j +
1What is the time complexity of this algorithm?