Use most basic PYTHON3 knowledge to answer the question.

4. (2 pts) Consider the list [55, 24, 16, 13, 21, 44, 26, 31] which we want to sort using merge sort: Merge Sort Algorithm: 1. Sort the first half of the list 2. Sort the second half of the list. 3. Merge the two sorted halves to get a sorted list. (a) Show the first half of the list after step 1 is done. Show the second half of the list after step 2 is done (b) Show the merge process of step 3 using the lists from parts a and b by tracing this step as shown in the course slides/notes. @ @Mao1 22

4. (2 pts) Consider the list [55, 24, 16, 13, 21, 44, 26, 31] which we want to sort using merge sort: Merge Sort Algorithm: 1. Sort the first half of the list 2. Sort the second half of the list. 3. Merge the two sorted halves to get a sorted list. (a) Show the first half of the list after step 1 is done. Show the second half of the list after step 2 is done (b) Show the merge process of step 3 using the lists from parts a and b by tracing this step as shown in the course slides/notes. @ @Mao1 22



Source link

Leave a Reply

Your email address will not be published. Required fields are marked *