Question

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 represents
bubble sort
binary search
quick sort
merge sort

Answer 1

The algorithm that represents swapping adjacent data points all the way through the list is the Bubble Sort algorithm.