notes void adjust(int []int iint nint jkint flagk [ ]flag iwhile( < &flag = if(( &( [jx[ ]) ++if( > [ ]flag else [ [ ] [ kvoid build_initial_heap(int []int nint ifor( > --adjust(xin)void heapsort(int []int nint ibuild_initial_heap(xn)for( -li > --exchange( [ ] [ ])adjust( , , )analysis of heapsort in each pass of while loop in procedure adjustx, , )the position is doubledhence the number of passes cannot exceed (loge div itherefore the computation time of adjust is (log div lovely professional university