Question

Write the selection sort algorithm in pseudo code

Short answer

Not given

Step-by-step solution

Step 1

Selection sort for pseudo code

A→list of items

n→ size of list

Step 2

We set minimum =0

Considering from i:= 1 to n-1

min=i

Step 3

We will check the minimum element in the list

for j:=i+1 to n

If A[j]<A[min]

then min=j

end if

end for

Step 4

We swap the minimum element with the current element

If min!= I then

swap A[min] and A[i]

end if

end for

end procedure

Final answer                                                                                                                        

The pseudo code for selection sort is ,

for i:=1 to n-1

min=i;

for j:=i+1 to n

if A[j]<A[min]

min=j;

end if

end for

If min!= I then

swap A[min] and A[i]

end if

end for

end procedure