Insertion sort falls in the category of quadratic time, but it gives $(n)$ complexity if:

Recursive approach adopted

Data$-$set is small

None of above

Data is already sorted