Can you please elaborate on the space complexity of this algorithm?
Space complexity
Heap sort is an in-place algorithm; it doesn’t require any extra space. Elements are rearranged during each recursive only inside the same array.
It provides a perception that a binary heap or tree is being formed, but in real scenario no tree or heap is being formed.
so 0(1)
i hope its cleared @Ayush-Kokande-2816457821730452 if yes don’t forget to mark the doubt resolved 