UGC NET PAPER 2 June 2019 Question 62 (Shift-I)

62. There are many sorting algorithms based on comparison. The running time of heap sort algorithm is O(nlogn). Let P, but unlike Q, heapsort sorts in place where (P,Q) is equal to

A Merge sort, Quick sort

B Quick sort, Insertion sort

C Insertion sort, Quick sort

D insertion sort, Merge sort

ANS. D

Previous	Next
UGC NET CS 2018 July - II Question 61	UGC NET CS 2018 July - II Question 63