Question

Which of the following relies on swapping adjacent elements to sort a dataset?(1 point)
Responses

bubble sort
bubble sort

quicksort
quicksort

merge sort
merge sort

selection sort

Answer 1

The sorting algorithm that relies on swapping adjacent elements to sort a dataset is **bubble sort**.