## Help authour, Buy PDF Ebook
>>>**Click Here**<<<

## Introsort Multiple choice Questions and Answers (MCQs)

## Click on any option to know the CORRECT ANSWERS

Question 6 |

Introsort sort is a comparison based sort.

true | |

false |

**Aptitude test Questions answers**

Question 6 Explanation:

Quicksort, heap sort and insertion sort are comparison based sorts. Thus overall introsort also becomes a comparison based sort.

Question 7 |

What is the best case time complexity of introsort?

O(n) | |

O(n log n) | |

O(n ^{2}) | |

O(log n) |

**Economics Questions answers**

Question 7 Explanation:

Introsort is mainly governed by heap sort and quick sort. As the best case of both heap sort and quick sort is O(n log n) so the best case of introsort also becomes O(n log n).

Question 8 |

What is the worst case time complexity of introsort?

O(n) | |

O(n log n) | |

O(n ^{2}) | |

O(log n) |

**UPSC Questions answers**

Question 8 Explanation:

Worst case time complexity of quicksort is avoided when we implement introsort. Introsort switches to heap sort when there is a possibility of crossing the maximum depth limit.

Question 9 |

What is the average time complexity of introsort?

O(n) | |

O(n log n) | |

O(n ^{2}) | |

O(log n) |

**Arab culture Questions answers**

Question 9 Explanation:

Average time complexity of introsort remains to be O(n log n) as for most of the cases quick sort and heap sort are used which have O(n log n) time complexity for an average case.

Question 10 |

What is the auxiliary space requirement of introsort?

O(n) | |

O(n log n) | |

O(n ^{2}) | |

O(log n) |

**Civics Test Questions answers**

Question 10 Explanation:

Introsort is a hybrid of quick sort, heap sort and insertion sort. So like quick sort it may use O(log n) auxiliary space in the stack to store call statements.

There are 10 questions to complete.