The algorithm you are describing, which involves swapping adjacent data points to order the data, 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
merge sort
merge sort
binary search
binary search
quick sort
quick sort
bubble sort
1 answer