# Introsort Multiple choice Questions and Answers (MCQs)

## Introsort Multiple choice Questions and Answers (MCQs)

 Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Which of the following sorting algorithm is used by C++ internally?
 A quicksort B introsort C merge sort D heap sort
Question 1 Explanation:
Introsort is the in built sorting algorithm used by C++. It is an example of a hybrid sorting algorithm which means it uses more than one sorting algorithm as a routine.

 Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Which of the following sorting algorithm is not a constituent of introsort?
 A selection sort B quicksort C insertion sort D heap sort
Question 2 Explanation:
Introsort is a hybrid sorting algorithm which means it uses more than one sorting algorithm as a routine. It may use quick sort or heap sort or insertion sort depending on the given situation.

 Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Introsort begins sorting the given array by using which of the following sorting algorithm?
 A selection sort B quick sort C insertion sort D heap sort
Question 3 Explanation:
Introsort begins sorting any given array by using quick sort. Then it may switch to heap sort or insertion sort or may stick to quick sort depending upon the size of the partition.

 Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Which of the following sorting algorithm is NOT stable?
 A Introsort B Brick sort C Bubble sort D Merge sort
Question 4 Explanation:
Out of the given options introsort is the only algorithm which is not stable. As it may use quick sort in some case to perform sorting which is itself not stable. Thus stability of introsort is not guaranteed.

 Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Which of the following sorting algorithm is in-place?
 A intro sort B merge sort C counting sort D radix sort
Question 5 Explanation:
Introsort may use quick sort or heap sort or insertion sort internally in order to sort the given input. All of the three algorithms are in place, thus making introsort to be an in-place sorting algorithm.

There are 5 questions to complete.