Computer scienceAlgorithms and data structuresAlgorithmsArray algorithmsSorting algorithms

Insertion sort

Properties of algorithm

Report a typo

Select a correct statement about insertion sort.

Select one option from the list

The algorithm is unstable.

A moving element is inserted in any position in the sorted part.

The algorithm shifts elements in the sorted part.

The worst-case time complexity is O(n log n).

Create a free account to access the full topic