Which sorting algorithm can be most efficient when the number of records to be sorted is small - CPEN Talk - Get CSE solutions and download PDFs for free.

The Insertion Sort Algorithm is most efficient when the number of records to be sorted is small. This is because the time function in insertion sort is small.

Your comment on this answer:

Improve the existing answer with your comment.

Email me at this address if a comment is added after mine:Email me if a comment is added after mine

Privacy: Your email address will only be used for sending these notifications.

Anti-spam verification:

To avoid this verification in future, please log in or register.