
2. Consider the array A-8, 3, 4, 5, 2, l , 0.9, 7. 이. (a) (5 pts) Demonstrate how the insertion sort algorithm works, by showing what A looks like each time the while loop terminates (CLRS page 18 has the algorithm) (b) (5 pts) Demonstrate how the merge sort algorithm works, by show- ing how the array is split for each recursive call, and how the algo- rithm then merges
PayPal Gateway not configured
PayPal Gateway not configured