Sorting Algorithms II
Assessment
•
Yomna Elkholy
•
Computers
•
University
•
25 plays
•
Hard
Student preview
18 questions
Show all answers
1.
MULTIPLE CHOICE
30 sec • 1 pt
Merge sort uses which of the following techniques to implement sorting?
2.
MULTIPLE CHOICE
30 sec • 1 pt
What is the best case time complexity of merge sort?
3.
MULTIPLE CHOICE
30 sec • 1 pt
What is the worst case time complexity of merge sort?
4.
MULTIPLE CHOICE
30 sec • 1 pt
What is the auxiliary space complexity of merge sort?
5.
MULTIPLE CHOICE
30 sec • 1 pt
A stable sorting algorithm
6.
MULTIPLE CHOICE
30 sec • 1 pt
An adaptive sorting algorithm
7.
MULTIPLE CHOICE
30 sec • 1 pt
Which of the following is not an in-place sorting algorithm?
8.
MULTIPLE CHOICE
30 sec • 1 pt
Choose the incorrect statement about merge sort from the following:
9.
MULTIPLE CHOICE
30 sec • 1 pt
Choose the correct code for a merge sort.
10.
MULTIPLE CHOICE
30 sec • 1 pt
Quick sort follows the divide-and-conquer strategy.
Explore all questions with a free account
Similar Resources on Quizizz
Popular Resources on Quizizz
5 questions
Brain Teasers
•
KG - University
37 questions
Math STAAR Review
•
4th Grade
12 questions
Earth Day
•
4th Grade
25 questions
STAAR REVIEW - SCIENCE
•
5th Grade
20 questions
Science STAAR Review! 23-24
•
5th Grade
20 questions
Reading Comprehension
•
5th Grade
20 questions
Types of Credit
•
9th - 12th Grade
23 questions
Math STAAR Review
•
4th Grade