chiara44

What can be the best case in insertion sort?

In which situation, Insertion sort can make the quickest sorting?

Add a comment

0%

6 replies

theeconomist1

When all elements are alredy sorted, it is called the best case pf Insertion sort. Source: http://in.docsity.com/en-video/Data_Structures_and_Algorithms-Naveen_Garg-Lecture_1

Add a comment

michaelporter

Best case, when elements are already sorted.

Add a comment