Q148
Consider the code given below, which runs insertion sort: void insertionSort(int arr[], int array_size) int i, j, value; for (i = 1; i < array_size; i++) value = arr[i]; j = i; while (________ ) arr[j] = arr[j − 1]; j = j − 1; arr[j] = value; Which condition will correctly implement the while loop?
A.
(j > 0) || (arr[j - 1] > value)
B.
(j > 0) && (arr[j - 1] > value)
AnswerC.
(j > 0) && (arr[j + 1] < value)
D.
(j > 0) && (arr[j + 1] < value)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board