1 votes 1 votes If the number of records to be sorted is small, then ...... sorting can be efficient. A. Merge B. Heap C. Insertion D. Bubble Algorithms algorithms sorting + – Purple asked Jan 27, 2016 Purple 24.7k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply shivanisrivarshini commented Jan 27, 2016 reply Follow Share i think insertion sort 0 votes 0 votes Purple commented Jan 27, 2016 reply Follow Share Ya, its right, can you explain why? how does size matter which sorting? 0 votes 0 votes Please log in or register to add a comment.
Best answer 5 votes 5 votes Insertion Sort The constants in the time function in insertion sort is small. When the input size is small ,other algos prove to take greater time . but when input is large enough nlogn algos are efficient. Saurav Singh answered Apr 3, 2016 selected Apr 3, 2016 by Arjun Saurav Singh comment Share Follow See 1 comment See all 1 1 comment reply Vamsi krishna satya commented Oct 23, 2018 reply Follow Share can you give the constants in case of insertion and merge sort? 0 votes 0 votes Please log in or register to add a comment.