The worst case running times of Insertion sort, Merge sort and Quick s — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2024 paper

Module 2: Divide and Conquer Paradigm and Heaps

20242m

The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:

(i) $\Theta(n \log n)$ , $\Theta(n \log n)$ and $\Theta(n^2)$
(ii) $\Theta(n^2)$ , $\Theta(n^2)$ and $\Theta(n \log n)$
(iii) $\Theta(n^2)$ , $\Theta(n \log n)$ and $\Theta(n \log n)$
(iv) $\Theta(n^2)$ , $\Theta(n \log n)$ and $\Theta(n^2)$

Search Google Ask AI

Similar questions

Design and Analysis of Algorithms Which sorting algorithm is considered stable and has a time complexity of O(n^2)? (i) Quick sort (ii) Merge sort (iii) Insertion sort (iv) Selection sort20232m Design & Analysis of AlgorithmsWorst-case complexity of heap sort is - - (i) O(\log n) - (ii) O(n^2) - (iii) O(n \log n) - (iv) O(n)20242m Design & Analysis of AlgorithmsAssume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following is TRUE? I. Quicksort runs in \Theta(n^2) time II. Bubblesort runs in \Theta(n^2) time III. Mergesort runs in \Theta(n) time IV. Insertion sort runs in \Theta(n) time - (i) I and II only - (ii) I and III only - (iii) II and IV only - (iv) I and IV only20242m Design and Analysis of Algorithms Which of the following sorting algorithms has the best time complexity in the average case? (i) Bubble sort (ii) Insertion sort (iii) Quick sort (iv) Selection sort20232m

PreviousWorst-case complexity of heap sort is - - (i) O(\log n) - (ii) O(n^2) - (iii) O(n \log n) - (iv) O(n)NextThe minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is - (i) O(n) - (ii) O(\log n) - (iii) O(n \log n) - (iv) O(1)