Here is the pseudocode for Selection Sort with time values given. You can assume that lines

without time values take no time at all.

# Selection Sort

# A is a list of length $n.$

for $i=0$ to $n-2$

minindex $=i,c_1$

for $j=i+1$ to $n-1$

if