The insertion sort algorithm allows to sort an array in a certain order. Among the following statements, which one best describes this sorting algorithm?

Question

Answer

At each step, we place the current element at the end of the array

Answer

At each step, we place the current element in its correct position in a sorted subarray

Answer

We compare the elements two by two, if an element is greater than the next, we swap them

Answer

At each step, we swap the current element with the smallest element in the array

Crowdly

The insertion sort algorithm allows to sort an array in a certain order. Among t...

Хочете миттєвий доступ до всіх перевірених відповідей на moodle.myefrei.fr?