Consider the following list k of foal names. (i) Use the bubble sort algorithm to sort the list k
into alphabetical order (so Apollo becomes the root of the list). Write down the list as it appears
at the end of each pass, highlighting the vertices that have been bubbled along in that pass.
Determine how many comparisons the bubble sort algorithm requires in this case. (ii) Use the
merge sort algorithm to sort the list k into alphabetical order. Write down the lists or sublists as
they appear at each stage of the algorithm. Determine how many comparisons the merge sort
algorithm requires in this case. (iii) Write down the result of applying the operation
INSERT(Lissie, 3,DELETE(5,k) )..
General Principles of Intellectual Property: Concepts of Intellectual Proper...
Consider the following list k of foal names. (i) Use the bubble sort .pdf
1. Consider the following list k of foal names. (i) Use the bubble sort algorithm to sort the list k
into alphabetical order (so Apollo becomes the root of the list). Write down the list as it appears
at the end of each pass, highlighting the vertices that have been bubbled along in that pass.
Determine how many comparisons the bubble sort algorithm requires in this case. (ii) Use the
merge sort algorithm to sort the list k into alphabetical order. Write down the lists or sublists as
they appear at each stage of the algorithm. Determine how many comparisons the merge sort
algorithm requires in this case. (iii) Write down the result of applying the operation
INSERT(Lissie, 3,DELETE(5,k) ).
