Insertion sort works best for nearly sorted or almost sorted array and gives the time complexity of $O(n)$ . So answer should be d

If found helpful, UPVOTE and mark ans as the BEST ANSWER (by clicking the blue tick on the left side of the ans). This motivates me to ANSWER YOUR QUESTIONS IN FUTURE

97 Points

15 Points

12 Points

9 Points

8 Points

7 Points