- Computer Science Engineering (CSE)
- Data Structures (DS)
- What is the worst-case time for heap sor...

Q. |
## What is the worst-case time for heap sort to sort an array of n elements? |

A. | O(log n). |

B. | O(n). |

C. | O(n log n). |

D. | O(nÂ²). |

Answer» C. O(n log n). |

View all MCQs in:
Data Structures (DS)

- An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of
- The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?
- The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array with improvised version?
- If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
- The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are,
- For the heap sort, access to nodes involves simple _______________ operations.
- The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort respectively are,
- Given an array arr = {45,77,89,90,94,99,100} and key = 99; what are the mid values(corresponding array elements) in the first and second levels of recursion?
- Given an array arr = {45,77,89,90,94,99,100} and key = 100; What are the mid values(corresponding array elements) generated in the first and second iterations?
- LSD radix sort requires passes to sort N elements.

Login to Continue

It will take less than 2 minutes

Report MCQ