Q$6$: $($True$/$False with justification$)$

We can determine how good an algorithm by it is conditions of correctness, time efficiency

and space efficiency.

For the following pseudocode of Insertion Sort the Basic operation of the code is for loop.

InsertionSort$($A$,n$

for $i=2$ to

key $=A[i]$

$j=i-1$

while $(j>0)$ and key