Heap sort (python)

Heap Sorting algorithm

First look at the first function heapadjust, this function is already the composition of the heap of the two-fork tree, if the node K data changes, the node K is modified to make it a new heap binary tree, n is the data length.

def heapadjust (lst,k,n): While    (2*k+1<n):        j=2*k+1        if J+1<n and lst[j]>lst[j+1]:            j=j+1        If LST[J]<LST[K]:            temp=lst[k]            lst[k]=lst[j]            lst[j]=temp            k=j        else:    break return LST

The Heapsort function, using the first function above, constructs a heap binary tree and uses the above function to sort

def heapsort (LST):    N=len (LST) for    I in range (int (N/2) -1,-1,-1):        lst=heapadjust (lst,i,n)    print (LST) For    i in range (n-1,0,-1):        temp=lst[0]        lst[0]=lst[i]        lst[i]=temp        lst=heapadjust (lst,0,i)    return LST

Test function

A=[1,5,2,8,3,4,6,9,7]print (a) result=heapsort (a) print (result)

Heap sort (python)