Consider the following code snippet:
Public static void sort(int[] a) {
For (int i = 1; i < a.length; i++)
{
int next = a[i];
int j = i;
while (j > 0 && a[j - 1] > next)
{
a[j] = a[j - 1];
j--;
}
a[j] = next;
}
}
What sort algorithm is used in this code?

Question

Consider the following code snippet:
Public static void sort(int[] a) {
For (int i = 1; i < a.length; i++)
{
int next = a[i];
int j = i;
while (j > 0 && a[j - 1] > next)
{
a[j] = a[j - 1];
j--;
}
a[j] = next;
}
}
What sort algorithm is used in this code?
A) insertion sort
B) selection sort
C) merge sort
D) quicksort

Quizplus · Accepted Answer

The code uses the insertion sort algorithm, which sorts an array by gradually building up a sorted subarray at the beginning of the array. It takes the next element from the unsorted part of the array and inserts it in its proper position in the sorted subarray. This process is repeated until all elements are sorted.

Consider the Following Code Snippet