Font size
S
M
L
XL
Worksheetssorting techniques
Total questions: 5
Worksheet time: 3mins
Name
Class
Date
1.
1. What is the time complexity of Bubble Sort in the worst-case scenario?
a)
a. O(1)
b)
b. O(n log n)
c)
O(n)
d)
O(n^2)
2.
2. In Selection Sort, what is maintained during the execution of the algorithm?
a)
Two subarrays - sorted and unsorted
b)
A priority queue
c)
Binary search tree
d)
A linked list
3.
3. Which sorting algorithm is known for maintaining a sub-array that is always sorted during its execution?
a)
Quick Sort
b)
Merge Sort
c)
Insertion Sort
d)
Non of the above
4.
Insertion Sort has a better average and worst-case time complexity compared to Selection Sort.
a)
True
b)
False
5.
Bubble Sort not occupies extra memory space during its execution.
a)
True
b)
False
Reset
