Computer scienceAlgorithms and data structuresAlgorithmsArray algorithmsSorting algorithms

Insertion sort

Just the facts!

Report a typo

Which of these statements are advantages of insertion sort?

Select one or more options from the list

The moving element is inserted in a suitable position in the sorted part.

The algorithm requires only a constant additional memory.

The algorithm works with three subarrays: the sorted subarray, the partial-sorted one and the unsorted one.

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

Create a free account to access the full topic