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 represent?(1 point)
Responses

binary search
binary search

bubble sort
bubble sort

quick sort
quick sort

merge sort

Answer 1

The algorithm represented by the code that orders data by swapping adjacent data points all the way through the list is **bubble sort**.