0 votes
78 views
in Programming Languages & Algorithms by (user.guest)

1 Answer

0 votes
by (user.guest)
 
Best answer

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.


Related questions

0 votes
1 answer 141 views
+1 vote
1 answer 516 views
+1 vote
1 answer 2.7k views
Welcome to CPENTalk.com
Solution-oriented students of computer engineering on one platform to get you that

ONE SOLUTION

...