iam not able to understand the way of calculating an algorithm as an stable or unstable algorithm
Is this is stable sorting algorithm?
Heapsort is not stable because operations on the heap can change the relative order of equal items.
You can refer this:
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.