1. a) For each of the following lists, perform both a selection and bubble sort and show the list after each exchange is made (find the bubble sort algorithm within the end-of-chapter exercises of the text and the selection sort is in section 3.3.3; you practiced with it at the end of that section).

Create a table that shows the changing data set for each sort with the selection sort on the left and the bubble sort on the right.

b) Prepare a table to compare the number of exchanges made using the selection sort with the number of exchanges made using the bubble sort.

c) For each of these two algorithms (selection and bubble) explain, in detail, why they both do (n²) comparisons on an n element list and why there are differences between the two.

(10 marks)

1. 4, 8, 2, 6
2. 12, 3, 6, 8, 2, 5, 7
3. D, B, G, F, A, C, E