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.

ONE SOLUTION