a) Heap sort is an in-place algorithm
b) Heap sort has O(nlogn) average case time complexity
c) Heap sort is stable sort
d) Heap sort is a comparison-based sorting algorithm
Which one of the following is false?
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Which one of the following is false?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!