heap sort complexity

This is a created article in which the information may have evolved or changed. "' Gopackage mainimport (" FMT ") func main () {array2: = []int{3, 2, 1}heapsort (array2) fmt. Println ("Heapmy", Array2)}func heapsort (array []int) {EP: = (len (array)-1) >> 1fmt. Println (EP) for I: = EP; I >= 0; i--{heapt (array, I, Len (array)-1)}for I: = Len (array)-1; i > 0; i--{array[0], array[i] = Array[i], array[0]heapt (array, 0, i-1)}}func heapt (array []int, start int, end int) {le: = start * * + 1re:

) { returnPriorityqueue (N1.merge (N1.getroot (), N2.getroot ()), n1.size () +n2.size ()); } node* Merge (node* N1, node* n2)//whether continue or direction? (minimum leftist heaps) { if(N1 = =NULL)returnN2; if(N2 = =NULL)returnN1; if(N1->data data) {mergeoperate (n1, N2); returnN1;// } Else{mergeoperate (N2, N1); returnN2;//}} node* Mergeoperate (node* N1, node*n2) { if(N1->left = =NULL) {N1->left =N2; returnN1; } Else{N1->right = Merge (n

JavaScript sorting algorithm--heap sort

#include using namespacestd;voidHeapadjust (intBintStartintN) { intmax=start; intLchild = start*2+1; intRchild = start*2+2; if(Start 1)/2){ if(Lchild A[max]) {Max=Lchild; } if(Rchild A[max]) {Max=Rchild; } if(max!=start) {Swap (A[start], A[max]); Heapadjust (A, max, n); } }}voidBuildheap (intBintN) {//N: [0,n] for(inti = (n1)/2; I >=0; i--) {Heapadjust (A, I, N); }}voidHeapsort (int*a,intN) {buildheap (a,n); for(inti=n;i>=0; i--) {Swap (a[0],a

#include 　　Heap sort C + + implementation

1#include 2 using namespacestd;3 4 intPARENT (Const inti) {5 return(i>>2)-1;6 }7 8 intLeft (Const inti) {9 return(i1)+1;Ten } One A intRight (Const inti) { - return(i1) +2; - } the - voidMax_heapify (int*ConstAConst inti,Const intheap_size) { - intL =Left (i); - intR =Right (i); + intlargest=i; - if(L A[i]) { +largest =l; A } at Else{ -largest =i; - } - - if(RA[largest]) { -largest =R; in } - if(Largest! =i) { to intKey =A[i]; +A[i]

than base from the front - $ if(I >= J) Break;//Note that the equals sign $ - swap (Arry[i], arry[j]); - } the -Swap (Arry[lo], arry[j]);//determine the location of JWuyi the returnJ; - } Wu - voidQsort_3way (vectorint> arry,intLointhi) About { $ if(Lo >= hi)return; - - intLt=lo, i=lo+1, gt=Hi; - intPivot =Arry[lo]; A + while(I GT) the { - if(arry[i]pivot) $Swap (arry[lt++], arry[i++]);//i++, should be Lt->pivot, after Exchange lt++, pivot, i+