write a kotlin function to sort an array by following this pseudocode:

pseudocode is generic language between english and code. it is not language specific −$-$ it can be applied to any programming language.

procedure sort($($ list : array of items )$)$

loop =$=$ list.count;

for i =0$=0$ to loop−1$-1$ do:

swapped =$=$ false

for j =0$=0$ to loop−1$-1$ do:

/*$/*$ compare the adjacent elements */$*/$

if list[$[$j]>$]>$ list[$[$j+1]$+1]$ then

/*$/*$ swap them */$*/$

swap($($ list[$[$j],$],$ list[$[$j+1])$+1])$

swapped =$=$ true

end if

end for

/*$/*$if no number was swapped that means

array is sorted now, break the loop.*/$*/$

if($($not swapped)$)$ then

break

end if

end for

end procedure return list

Answer rating: 100% (QA)

The pseudocode you provided outlines a version of the Bubble Sort algorithm It repeatedly steps thro... View the full answer