Un algorithme en O(n!) est plus rapide qu'un algorithme en O(2 n ).

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

Want instant access to all verified answers on ena.etsmtl.ca?

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

Add to Chrome