Trace a walkthrough of selection sort with the following list:

4 7 11 4 9 5 11 7 3 5

Heres a start:

i minPos minVal [4, 7, 11, 4, 9, 5, 11, 7, 3, 5] 0 8 3 [3, 7, 11, 4, 9, 5, 11, 7, 4, 5]

Trace a walkthrough (like I showed in class) of merge sort with the following list:

5 11 7 3 5 4 7 11 4 9

Modify the selection sort algorithm to sort a list of integers in descending order.

Your code with comments

A screenshot of the execution

Modify the merge sort algorithm to sort a list of integers in descending order.

Your code with comments

A screenshot of the execution