NEW
Font size
S
M
L
XL
WorksheetsQuick Sort Presentation Quiz
Total questions: 6
Worksheet time: 3mins
Name
Class
Date
1.
Quick Sort Algorithm Follows A Divide & Conquer Approach
a)
True
b)
False
2.
What is one of the advantages of quick sort?
a)
It does in-place sort and doesnt use any extra storage memory
b)
It is efficient for small datasets
c)
It can be used to sort both integers and strings
d)
It has a worst-case time complexity of O(n^2)
3.
Once a pivot has been chosen, all elements smaller than the pivot are placed to the right sub-array, while all elements bigger than the pivot are placed to the left sub-array.
a)
True
b)
False
4.
What Is The Big O Notation For Quick Sort?
a)
O(n log n)
b)
O(n^2)
c)
O(log n)
d)
O(n)
5.
Quick Sort Is Mainly Used In Operational Research & Event Driven-Simulation
a)
True
b)
False
6.
Quick Sort Is Slower Compared To Merge Sort Or Heap Sort
a)
True
b)
False
Reset
