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

bubble sort
bubble sort

selection sort
selection sort

quicksort
quicksort

merge sort
merge sort

bubble sort

The given pseudocode represents the Bubble Sort algorithm.