logo

Crowdly

Browser

Add to Chrome

Quelle est la complexité algorithmique en temps de la fonction suivante ? What...

✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.

Quelle est la complexité algorithmique en temps de la fonction suivante ?

What is the algorithmic time complexity of the following function?

public void fonction(int n) {

if (n > 0) {

int i = 2 * n;

int j = i + 1;

System.out.println(j);

} else {

System.out.println(n);

}

}

0%
0%
0%
0%
More questions like this

Want instant access to all verified answers on moodle-ovh.isep.fr?

Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!

Browser

Add to Chrome