Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Searching, Sorting and Hashing Sorting
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
1
Merge sort, Quick sort
2
Quick sort, Insertion sort
3
Insertion sort, Quick sort
4
insertion sort, Merge sort