Free Printable Sorting Quiz

1.

How many passes does an insertion sort algorithm consist of?

a)

n

b)

n-1

c)

n+1

d)

$n^2$

2.

What is the average case running time of an insertion sort algorithm?

a)

$O\left(n\right)$

b)

$O\left(n\log n\right)$

c)

$O\left(\log n\right)$

d)

$O\left(n^2\right)$

3.

Insertion Sort is

a)

stable and sorts in place

b)

unstable and sorts in place

c)

stable and does NOT sort in place

d)

NOT stable and does NOT sort in place

4.

Which of the following sorting algorithm is best suited if the elements are already sorted?

a)

Insertion Sort

b)

Merge Sort

c)

Heap Sort

5.

Merge sort uses which of the following technique to implement sorting?

a)

backtracking

b)

greedy algorithm

c)

divide and conquer

d)

dynamic programming

6.

What is the average case time complexity of merge sort?

a)

$O\left(n\log n\right)$

b)

$O\left(n^2\log n\right)$

c)

$O\left(n^2\right)$

d)

$O\left(n\right)$

7.

What is the space complexity of merge sort?

a)

$O\left(n^2\right)$

b)

$O\left(1\right)$

c)

$O\left(2\right)$

d)

$O\left(n\right)$

8.

What is the worst case time complexity of merge sort?

a)

$O\left(n\log n\right)$

b)

$O\left(n^2\log n\right)$

c)

$O\left(n^2\right)$

d)

$O\left(n\right)$

9.

Which of the following is good for sorting arrays having less than 40 elements?

(a)

10.

Time it takes to build a binary heap

a)

$O\left(n\right)$

b)

$O\left(n^2\right)$

c)

$O\left(n^3\right)$

11.

What is the corresponding array for this tree? (Answer format: 1 2 3 4)

(a)

12.

The essential part of Heap sort is construction of max-heap. Consider the tree shown below, the node 24 violates the max-heap property. Once heapify procedure is applied to it, which position will it be in?

a)

7

b)

3

c)

9

d)

4

13.

What is its wort case time complexity of Heap sort?

a)

$O\left(n\right)$

b)

$O\left(n^2\right)$

c)

$O\left(n\log n\right)$

d)

$O\left(1\right)$

14.

Which sorting algorithm will take least time when all elements of input array are identical? Consider typical implementations of sorting algorithms.

a)

Heap Sort

b)

Merge Sort

c)

Insertion Sort

15.

A max-heap is a heap where the value of each parent is greater than or equal to the values of its children. Which of the following is a max-heap?

a)

A

b)

B

c)

D

d)

C

Sorting Quiz

Total questions: 15

Worksheet time: 8mins

Similar Resources on Wayground