CS $2124-$ Data Structures

Growth analysis

NAME:

For each of the below code snippets, identify the asymptotic runtime in terms of $n($i$.$e$.$ the Big$-$Oh runtime of the function$).$ Justify your answer briefly:

$(1)$ for $(i=1$; i $\}$

$k=k**2$;

$\{$