Question $3$

Suppose an algorithm runs in time $1\mathrm{.}52$n$+1\mathrm{.}2$n$21\mathrm{.}52$n$+1\mathrm{.}2$n$2$ in the worst case. Select the correct answer from the choices below.

Status: $[$object Object$]$

$2$ points

Its running time can be expressed as O$(3$n$)$O$(3$n$)$

Since constants are ignored in asymptotic running time, we can write the running time as $(22$n$)(22$n$)$

The factor $1\mathrm{.}2$n$21\mathrm{.}2$n$2$ dominates the other term $2$n$2$n$.$ Thus, the algorithms asymptotic complexity is O$($n$2)$O$($n$2).$

Running times like $2$n$2$n are not possible for algorithms we program.