heap sort python

This document tags: heap sort php php algorithm heap sorting algorithm two fork heap data structure /c12> REST server What is a heapHere the heap (binary heap), refers to not the stack of the

Code:#!/usr/bin/env python#Coding=utf-8Importrandom,copydefHeap_sort_helper (lst,left,right):#Max HeapifyCurrent_value =Lst[left] child= 2 * left + 1 while(Child Right ):if(Child andLst[child] ]): child= child + 1if(Current_value >Lst[child]): Break Else: lst[( child-1) >>1] =Lst[child] child= 2 * child + 1lst[( child-1) >>1] =Current_valuedefHeap_sort (LST):#Build Heap forIinchRange (len (LST)-

Heap Sort Heap ordering is a sort of tree selection, which is an effective improvement of direct selection sort.Basic idea:The heap is defined as follows: A sequence with n elements (k1,k2,..., kn), if and only if satisfied Case 1:ki Case 2:ki >= k2i and Ki >= k2i+1 (maximi

;}}Hill sortHill sort when inserting a sort of upgraded version, there is a descending increment sequence, which is generally sorted by the array size n, constantly pressing the increment div of N/2, each time comparing the number of increments between these numbers, the number of these several sorts;Time complexity uncertainty, instability, preferably O (N).void Shellsort () {int len = n;for (int div = LEN

:#Coding:utf-8#!/usr/bin/pythonImportRandomImportMath#randomly generate a value between 0~100defget_andomnumber (num): Lists=[] I=0 whileinum:lists.append (random.randint (0,100)) I+=1returnlists#Adjustment Heapdefadjust_heap (lists, I, size): Lchild= 2 * i + 1Rchild= 2 * i + 2Max=IifI : ifLchild andLists[lchild] >Lists[max]: Max=LchildifRchild andLists[rchild] >Lists[max]: Max=RchildifMax! =I:lists[max], Lists[i]=Lists[i], Lists[max] adjust_heap (lists, max, size)#Create Heapdefbuild_h

A variety of common sortTo start looking for a job, the previous learning of a variety of small knowledge to review, the following is a variety of common sort of simple implementation (bubble sort, choose sort, insert sort, hill sort, he