What code is this for?

public static void Sort$($Comparable$[]$ A $)\{$ int i; for$($ i $=$ A$.$length$-1$; i $>0$; i$--)\{//$ find maximum value in A$[0..$i$]$ int maxIndex $=0$; int j; for$($ j $=1$; j $<=$ i; j$++)\{/*$ inner loop invariant: for all k $<$ j$,$ A$[$maxIndex$]>=$ A$[$k$]*/$ if $($A$[$maxIndex$].$compareTo$($A$[$j$])<0)$ maxIndex $=$ j; $\}/*$ swap largest $($A$[$maxIndex$])$ into A$[$i$]*/$ swapReferences$($ A$,$ i$,$ maxIndex $)$; $\}\}$

Group of answer choices

Swap Sort

Buble sort

Selection sort

Quick sort