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