Which of the following sorting algorithms is the fastest?

a$)$ Merge sort

b$)$ Quick sort

c$)$ Insertion sort

d$)$ Shell sort

$7.$ Which of the following methods is the most effective for picking the pivot element?

a$)$ first element

b$)$ last element

c$)$ median$-$of$-$three partitioning

d$)$ random element

$8.$ Which of the following sorting algorithms is used along with quick sort to sort the

sub arrays?

a$)$ Merge sort

b$)$ Shell sort

c$)$ Insertion sort

d$)$ Bubble sort

$9.$ Which is the worst method of choosing a pivot element?

a$)$ first element as pivot

b$)$ last element as pivot

c$)$ median$-$of$-$three partitioning

d$)$ random element as pivot

$10.$ On which algorithm is heap sort based on$?$

a$)$ Fibonacci heap

b$)$ Binary tree

c$)$ Priority queue

d$)$ FIFO