Insertion Sort, Algorithms, Data Structure Algorithm, Coding Interviews, Job Hunting.
means it reduces its total number of comparisons/steps if a partially sorted array is provided as the input, making it efficient (as discussed in the time complexity section). Its space complexity is O(1). It is efficient for smaller size array. It uses an incremental approach as an algorithm