Computers and Technology
Let U = {b1, b2, , bn} with n 3. Interpret the following algorithm in the context of urn problems. for i is in {1, 2, , n} do for j is in {i + 1, i + 2, , n} do for k is in {j + 1, j + 2, ..., n} do print bi, bj, bk How many lines does it print? It prints all the possible ways to draw three balls in sequence, without replacement. It prints P(n, 3) lines. It prints all the possible ways to draw an unordered set of three balls, without replacement. It prints P(n, 3) lines. It prints all the possible ways to draw three balls in sequence, with replacement. It prints P(n, 3) lines. It prints all the possible ways to draw an unordered set of three balls, without replacement. It prints C(n, 3) lines. It prints all the possible ways to draw three balls in sequence, with replacement. It prints C(n, 3) lines.
Trace the complete execution of the MergeSort algorithm when called on the array of integers, numbers, below. Show the resulting sub-arrays formed after each call to merge by enclosing them in { }. For example, if you originally had an array of 5 elements, a = {5,2,8,3,7}, the first call to merge would result with: {2, 5} 8, 3, 7 Note after the first call to merge, two arrays of size 1 have been merged into the sorted subarray {2,5} and the values 2 and 5 are sorted in array a You are to do this trace for the array, numbers, below. Be sure to show the resulting sub-arrays after each call to MergeSort. int[] numbers = {23, 14, 3, 56, 17, 8, 42, 18, 5};
