Question

You are given the following algorithm ALG whose input is an array of numbers. Calculate its best-case and worst-case running time complexities. Assume that cost of execution of a single line takes constant time $c_i$ where $i = 1,2,...,11$. LINE TIMES COST BEST WORST ALG (A) $(+11)$ 1 a = 5 $c_1$ 1 1 2 b = a - 4 $c_2$ 1 1 3 if (A[1] > (a+2)) then $c_3$ 1 1 4 if (A[2] > 2) then $c_4$ 0 1 5 for i$\leftarrow$0 to length (A) * length (A) do $c_5$ 0 $n^2$+2 6 a = a + b $c_6$ 0 $n^2$+1 7 else for k$\leftarrow$1 to 1 do $c_7$ 0 0 8 b = a + b $c_8$ 0 0 9 for j$\leftarrow$4 to length (A) do $c_9$ 1 $n$-2 10 b = b - a $c_{10}$ 0 $n$-3 11 return a $c_{11}$ 1 1

          You are given the following algorithm ALG whose input is an array of numbers. Calculate its
best-case and worst-case running time complexities. Assume that cost of execution of a single
line takes constant time $c_i$ where $i = 1,2,...,11$.
LINE
TIMES
COST
BEST WORST
ALG (A)
$(+11)$
1
a = 5
$c_1$
1
1
2
b = a - 4
$c_2$
1
1
3
if (A[1] > (a+2)) then
$c_3$
1
1
4
if (A[2] > 2) then
$c_4$
0
1
5
for i$\leftarrow$0 to length (A) * length (A) do
$c_5$
0
$n^2$+2
6
a = a + b
$c_6$
0
$n^2$+1
7
else for k$\leftarrow$1 to 1 do
$c_7$
0
0
8
b = a + b
$c_8$
0
0
9
for j$\leftarrow$4 to length (A) do
$c_9$
1
$n$-2
10
b = b - a
$c_{10}$
0
$n$-3
11 return a
$c_{11}$
1
1

You are given the following algorithm ALG whose input is an array of numbers. Calculate its
best-case and worst-case running time complexities. Assume that cost of execution of a single
line takes constant time ci where i = 1,2,...,11.
LINE
TIMES
COST
BEST WORST
ALG (A)
(+11)
1
a = 5
c1
1
1
2
b = a - 4
c2
1
1
3
if (A[1] > (a+2)) then
c3
1
1
4
if (A[2] > 2) then
c4
0
1
5
for i←0 to length (A) * length (A) do
c5
0
n^2+2
6
a = a + b
c6
0
n^2+1
7
else for k←1 to 1 do
c7
0
0
8
b = a + b
c8
0
0
9
for j←4 to length (A) do
c9
1
n-2
10
b = b - a
c10
0
n-3
11 return a
c11
1
1

Added by Rhonda C.

Question

Please give Ace some feedback