What type of algorithm is the following code?

i $=0$

while i $$ len$($myList$)-1$:

minIndex $=$ i

j$\}=$i$+$

while j $$ len$($myList$)$:

if myList$[$j$]$ myList$[$minIndex$]$:

minIndex $=$ j

j $+=1$

if minIndex $!=$ i:

swap$($myList$,$ minIndex, i$)$

i $\}+=$

sequential search

bubble sort

binary search

selection sort