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?

a. merge sort
b. bubble sort
c. quick sort
d. binary search

b. bubble sort

The algorithm represented by swapping adjacent data points all the way through the list is b. bubble sort.