1 votes 1 votes Which of the following sorting algorithm can sort at runtime? 1). Heapsort 2). Merge sort 3). Insertion Sort 4). Selection Sort This is a self made question. So many options many be correct. Algorithms algorithms sorting + – thor asked Nov 23, 2016 thor 759 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Lokesh . commented Nov 23, 2016 reply Follow Share what do you mean by sort at runtime? 0 votes 0 votes Purple commented Nov 23, 2016 reply Follow Share I think it means on the fly. As soon as you enter 3, it is sorted, then if you add 2, it becomes 2,3 and 2,3 is stored in the memory. I think this is what it means to 'calculate at runtime'. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes First of all I did not understand the question properly but I think it should be heapsort as its used for dynamic applications.Whenever you remove elements from top of max (or min heap) the larger (or smaller ) element will rise up to the top. Surajit answered Dec 20, 2016 Surajit comment Share Follow See 1 comment See all 1 1 comment reply saurabh rai commented Dec 20, 2016 reply Follow Share First of all there is no any relation bw heap sort and heap data structure. heap sort is implemented by array , run time mechanism is depends upon programming lang not an algorithm. and there is no need to answer every question :) 0 votes 0 votes Please log in or register to add a comment.