Question

What is the cut-off for switching from quick sort to insertion sort in the implementation of introsort?

(a) 4

(b) 8

(c) 16

(d) 32

Answer 1

Right option is (c) 16

For explanation: When small arrays needs to be sorted then insertion sort proves to be the best choice. So when the size of the partition is less than 16 introsort switches to insertion sort. This particular value has been deduced experimentally.