0 votes 0 votes Algorithms sorting heap-sort test-series + – reena_kandari asked Jan 10, 2017 retagged Jul 16, 2022 by makhdoom ghaya reena_kandari 522 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes What is the answer? rajatmyname answered Mar 9, 2018 rajatmyname comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes 1. Minimum no of comparison is ((3n)/2)-2. So then 6 is no of comparison if n= 5. 2. Heap sort is in-place algorithm but this is not a good explanation why we want to use it as an auxiliary sorting algorithm. ravi kant Gautam answered Apr 23, 2018 ravi kant Gautam comment Share Follow See 1 comment See all 1 1 comment reply abhishekmehta4u commented Apr 23, 2018 reply Follow Share 3n/2-2 is finding no of comparesion of maximum and minimum . not for soting. 0 votes 0 votes Please log in or register to add a comment.