Free Printable Test quiz

Worksheets

Name

Class

Date

Koks Merge Sort sudetingumas?

$O\left(n\right)$

$O\left(n^2\right)$

$O\left(n\log n\right)$

$O\left(\log n\right)$

Kokio sudetingumo algoritmai negautu TLE jei n=100000?

$O\left(n\right)$

$O\left(n^2\right)$

$O\left(n\log n\right)$

$O\left(2^n\right)$

$O\left(n!\right)$

Ivertinkite uzsiemima

1 - siaubingas

2 - blogas

3 - pusetinas

4 - geras

5 - puikus

Koks sio algoritmo sudetingumas?

for(int i = 0; i < n; i++) {

for(int j = 0; j < n; j++) {

// do sth

}

}

(a)

Reset

Similar Resources on Wayground