Higher Study | Compiler Design | Code Optimization

Practice Higher Study | Compiler Design | Code Optimization on Bissoy — browse topics below and open any question.

Questions

ক

Heap sort is an in-place algorithm

খ

Heap sort has O(nlogn) average case time complexity

গ

Heap sort is stable sort

ঘ

Heap sort is a comparison-based sorting algorithm