24,670 views
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

1 Answer

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.

selected by

Related questions

8 votes
8 votes
2 answers
2
2 votes
2 votes
1 answer
4
worst_engineer asked Oct 7, 2015
5,539 views
Which of the following sorting methods will be the best if number of swapping done is the only measure of efficiencyI am getting Bubble sort , is it right ?