Question

1. Which of the following algorithms requires the most extra space when implemented?

A. Quicksort

B. Mergesort

C. Radix sort

D. All use the same amount of extra space

2. Sort this array into ascending order: 80 90 70 85 60 40 50 95. Assume the pivot is 40. (SHOW WORK)

A. (40) and (50 60 70 80 85 90 95)

B. () and (80 90 70 85 60 50 95)

C. () and (50 60 70 80 85 90 95)

D. () and (80 50 60 70 85 90 95)

3. To put this array into ascending order: 80 90 70 85 60 40 150 295, we need ___ rounds using a radix sort

A. 1

B. 2

C. 3

D. 4

4. Sort the array: 5 7 4 9 8 6 3 into ascending order by using a bubble sort. What will the array look like after the first swap? (SHOW WORK)

A. 5 4 7 9 8 6 3

B. 5 7 4 9 8 3 6

C. 4 7 4 3 8 6 9

D. 3 7 4 9 8 6 5

Answer 1

1.
Mergesort algorithms requires the most extra space when implemented?
Answer:
B. Mergesort

2. 
Sort this array into ascending order: 80 90 70 85 60 40 50 95. Assume the pivot is 40
All elements less than 40 are on the left side (in the same order) and others are on the right side.
So, answer is () and (80 90 70 85 60 50 95)
Answer:
B. () and (80 90 70 85 60 50 95)

3. 
To put this array into ascending order: 80 90 70 85 60 40 150 295, we need 3 rounds using a radix sort
Max number of digits are 3.
So, answer is 3
Answer:
C. 3

4. 
Sort the array: 5 7 4 9 8 6 3 into ascending order by using a bubble sort. 
5 is less than 7, So, no swap needed.
7 is not less than 4. So, we have to swap 7 and 4.
the array look like after the first swap is 5 4 7 9 8 6 3
Answer:
A. 5 4 7 9 8 6 3