Start learning 50% faster. Sign in now
Quick Sort is not a stable sorting algorithm. Stability in sorting algorithms means that equal elements retain their relative order before and after sorting. Quick Sort does not guarantee this behavior because, during partitioning, equal elements may get swapped in such a way that their relative order is not preserved. Although Quick Sort is an efficient comparison-based sorting algorithm with an average time complexity of O(n log n), its lack of stability makes it unsuitable for cases where maintaining relative order of equivalent elements is crucial. Why Other Options are Incorrect: A) Merge Sort: This is a stable sorting algorithm as it ensures that the relative order of equal elements remains unchanged. B) Bubble Sort: Bubble Sort is stable as elements are swapped only if necessary. D) Insertion Sort: Insertion Sort is stable because it inserts equal elements in their original order. E) Tim Sort: Tim Sort is a stable sorting algorithm, combining Merge Sort and Insertion Sort properties.
Which feature allows you to rehearse the timing of a presentation?
Social Media platform applications focus on:
Which formatting feature in MS Word 365, is used to emphasise text by making it bold, italic or underlined in documents?
Which of the following shortcut key is used for print preview?
Which of the following is the shortcut key for paste?
To make the selected text bold, the shortcut key is ____
Which formula is used to join text from two cells in a spreadsheet?
In Excel, which function is used to find the smallest value within a range of cells?
How can you add a transition effect between slides in PowerPoint?
What is the full form of the acronym PDF?