Design and Analysis of Algorithms Quiz

Merge sort (correct)

Bubble sort

Insertion sort

Heap sort

$T(n) = T(\frac{n}{2}) + \theta(n)$

$T(n) = T(n-1) + \theta(n)$

$T(n) = 2T(\frac{n}{2}) + \theta(n)$ (correct)

$T(n) = T(n-1) + \theta(1)$

In the middle of the heap

At the root (correct)

At the leaf nodes

At the head of the queue

<p>When the input array is sorted in descending order</p> Signup and view all the answers

<p>Optimization problems</p> Signup and view all the answers