The Gateway to Computer Science Excellence
+1 vote
2k views

If the number of records to be sorted is small, then ...... sorting can be efficient.
A. Merge

B. Heap

C. Insertion

D. Bubble

in Algorithms by Active (3k points) | 2k views
0
i think insertion sort
0
Ya, its right, can you explain why? how does size matter which sorting?

1 Answer

+5 votes
Best answer

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.

by (195 points)
selected by
0
can you give the constants in case of insertion and merge sort?
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,284 answers
198,184 comments
104,863 users