Course 10043 Course Materials & Test Answers | training2.saveetha.in

If an algorithm runs in Θ(n²), what is its best case?

O(n²)

0%

Ω( n )

0%

Θ( n )

0%

O( n )

0%

View this question

What is the Big-O for selection sort in the average case?

O(log n)

0%

O(n²)

100%

O(n log n)

0%

O( n )

0%

View this question

If f( n ) = O(n²) and f( n ) ≠ Θ(n²), then:

f( n ) equals n²

0%

f( n ) grows slower than n²

100%

f( n ) grows faster than n²

0%

f( n ) is constant

0%

View this question

What is the main purpose of Big-O notation?

To express the upper bound of an algorithm's running time

100%

To represent the average performance

0%

To measure the exact time taken by an algorithm

0%

To represent the best-case performance

0%

View this question

Crowdly