Tag the questions with any skills you have. Your dashboard will track each student's mastery of each skill.
Give this quiz to my class
Q 1/15
Score 0
Which of the following describes the fundamental principle used by the Merge Sort algorithm?
30
Linear search
First-in, last-out
Divide and conquer
Bubble and swap
Q 2/15
Score 0
In the 'divide' stage of Merge Sort, when is the process of splitting the lists stopped?
30
When the list is split into two equal halves
When all elements are in reverse order
When each sub-list contains only one element
When the first element is smaller than the last element
15 questions
Q.
Which of the following describes the fundamental principle used by the Merge Sort algorithm?
1
30 sec
Q.
In the 'divide' stage of Merge Sort, when is the process of splitting the lists stopped?
2
30 sec
Q.
Which of the following is a disadvantage of using Merge Sort compared to an 'in-place' algorithm like Bubble Sort?
3
30 sec
Q.
4
30 sec
Q.
When merging two sorted sub-lists back together in Merge Sort, how does the algorithm determine the order of elements?
5
30 sec
Q.
Which of the following statements about the efficiency of Merge Sort is correct?
6
30 sec
Q.
Which of the following describes the 'Merge' step in the Merge Sort algorithm?
7
30 sec
Q.
Which of the following best describes the state of a list after the first 'divide' stage of Merge Sort has been completed on a list of 10 items?
8
30 sec
Q.
Which of the following is a characteristic of the Merge Sort algorithm?
9
30 sec
Q.
What is the time complexity of the Merge Sort algorithm in its worst-case scenario?
10
30 sec
Q.
If a Bubble Sort algorithm is applied to the list [5, 2, 8, 1, 9], what will the list look like after the first full pass?
11
30 sec
Q.
Which of the following is an advantage of Insertion Sort over Bubble Sort when dealing with a list that is already almost sorted?
12
30 sec
Q.
An Insertion Sort is being used to sort the list [3, 7, 2, 5] into ascending order. What will the list look like after the number 2 has been processed and inserted into its correct position?
13
30 sec
Q.
During a Bubble Sort of the list [6, 4, 3, 1], how many swaps will occur in the very first pass?
14
30 sec
Q.
Which of the following statements correctly describes a key difference between Bubble Sort and Insertion Sort?