Which of the following sort algorithms is represented by the pseudocode?
for all elements of list
if list[i]> list [i+1]
end if
end for
(1 point)
swap (list[i], list[i+1])
quicksort
merge sort
selection sort
bubble sort