Suppose a piece of code from an application is given to you, and you recognize that it is trying to order the data by swapping adjacent data points all the way through the list. What algorithm does this represent?(1 point) Responses merge sort merge sort bubble sort bubble sort binary search binary search quick sort quick sort

Answer 1

The algorithm you're describing, which involves ordering data by swapping adjacent data points, represents bubble sort.