Which algorithm iterates through a data set repeatedly, swapping values that are in the wrong order?

Using a bubble sort on the following list: 3, 17, 6, 5, 8. What will the list look like after the first pass?

Using a bubble sort on the following list: 3, 17, 6, 5, 8. What will the list look like after the second pass?

How many passes would the following list (3,17,6,5,8) need to sort it using a bubble sort?

Why do you need an additional pass through a list at the end of a bubble sort?

What is the first action in a merge sort?

Which sorting algorithm needs to iterate through the list repeatedly?

Which sorting algorithm splits a list of items into individual lists?

Which sorting algorithm uses the divide and conquer approach to sorting data sets?

What does a sorting algorithm do?

How can a trace table help with sorting algorithms?