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

S:=X[1]+X[N]
for 1 in range (N):
for 1 in range (N):
for 1 in range (N):
X[k] = X[k]+X[q]+S

Варианты ответов:
1) O(N)
2) O(N^2)
3) O(N^3)
4)O(2^n)
Please enter comments
Please enter your name.
Please enter the correct email address.
You must agree before submitting.

Answers & Comments


Copyright © 2024 SCHOLAR.TIPS - All rights reserved.