Crowdly

Add to Chrome

Оцените временную сложность приведенного фрагмента кода: i = 1 while i < n: ...

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

Оцените временную сложность приведенного фрагмента кода:

i = 1
while i < n:
    i += 1
    i *= k

O(log_n(k))

❌

O(log_k( n ))

✅

O(N)

❌

O(k)

❌

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

Add to Chrome