The algorithm you are describing, which involves ordering data by swapping adjacent data points all the way through the list, represents bubble sort.
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
binary search
binary search
merge sort
merge sort
bubble sort
bubble sort
quick sort
1 answer