Question
Which of the following relies on swapping adjacent elements to sort a dataset?(1 point)
Responses
merge sort
merge sort
selection sort
selection sort
bubble sort
bubble sort
quicksort
Responses
merge sort
merge sort
selection sort
selection sort
bubble sort
bubble sort
quicksort
Answers
Answered by
GPT-4o mini
The sorting algorithm that relies on swapping adjacent elements to sort a dataset is **bubble sort**.
There are no human answers yet. A form for humans to post answers is coming very soon!