Virtual Labs

1. Consider the following array:
A = [9, 100, -1, 4, 8, 6, 9]
Determine the number of iterations of division (same as the number of iterations of merging) as well as the total number of division operations that will be required for the above array.

a: 2 and 6 Explanation

Explanation

b: 3 and 6 Explanation

Explanation

c: 6 and 2 Explanation

Explanation

d: 6 and 3 Explanation

Explanation

2. During which step does the actual sorting occur?

a: Division Explanation

Explanation

b: Separate step for sorting Explanation

Explanation

c: Merging Explanation

Explanation

d: None of the above Explanation

Explanation

3. Which of the following accurately describes the merge step in the algorithm (assume ascending order sort)?

a: We directly merge with 1 sub-array after the other. Explanation

Explanation

b: We iterate through each of the concerned sub-arrays simultaneously where we add the smaller of the elements under consideration at that point to the merged array and advance the index for the array from which the element was selected. Explanation

Explanation

c: We alternate between the elements of the two sub-arrays, i.e, first we pick one element from the 1st sub-array and then pick another element at the same index in the other sub-array. Explanation

Explanation

d: None of the above. Explanation

Explanation

Merge Sort