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

Answer 1

The piece of code you described, which orders data by swapping adjacent data points, represents the **bubble sort** algorithm.