Question

in which situation insertion sort becomes ineffecient

Answer 1

${\huge{\mathcal{\purple{ANSWER :- }}}}$

Following are some of the important characteristics of Insertion Sort: It is efficient for smaller data sets, but very inefficient for larger lists. Insertion Sort is adaptive, that means it reduces its total number of steps if a partially sorted array is provided as input, making it efficient.