In heapsort algorithm :
Put the elements in an array
Make the array into a heap
Do a deletemin and put the deleted element at the last position of the array
the deletemin mentioned above : does it search the minimum and delete it or just deletes the root ?
for example, in the presentation , slide number 59 , is 7 in the last place of the array because deletemin was executed according to the algorithm or just was there ?