ithe procedure build-initial-heap calls the adjust procedure for values of ranging from / down to hence the total number of iterations will benotes / lognlog( / log( / / log( / lognlog( / = this comes out to be some constant times hence the computation time of build_initial_heap is (nthe heapsort procedure calls adjust ( ( - timeshence the total number of iterations made in the heap sort will ben- log( / = - log( log( log( log( = which comes out to be approx log(nhence the computing time of heapsort is ( log( ) (nthe only additional space needed by heap sort is space for one record to carry out exchange consider list given below when heapsort is applied to it we get following list to be sorted initial heap output after each pass of heapsort merge sort this is another sorting technique having the same average and worst case time complexityrequiring an additional list of size the technique that we use is the merging of the two sorted lists of size and respectively to form single sorted list of size ( +ngiven list of size to be sortedinstead of viewing it to be one single list of size nwe start by viewing it to be lists lovely professional university