} 4. Read the code below. private void insertSort (int[] a) { // TODO Auto-generated method...

 

 

Transcribed Image Text:

} 4. Read the code below. private void insertSort (int[] a) { // TODO Auto-generated method stub System.out.println(" int na.length; int i, j; for(i=1;i = 0 && a[j] > temp;j--){ a[j+1] = a[j]; a[j+1] = temp; print (a, n, i); printResult(a,n); } -Insertion Sort- -"); 1) Why the index i(the first for loop) starts from 1? And why j starts from i-1? 2) Assume the input is [4,3,2,1], please write down what would be the results after each for loop ends. } 4. Read the code below. private void insertSort (int[] a) { // TODO Auto-generated method stub System.out.println(" int na.length; int i, j; for(i=1;i = 0 && a[j] > temp;j--){ a[j+1] = a[j]; a[j+1] = temp; print (a, n, i); printResult(a,n); } -Insertion Sort- -"); 1) Why the index i(the first for loop) starts from 1? And why j starts from i-1? 2) Assume the input is [4,3,2,1], please write down what would be the results after each for loop ends.

Answer rating: 100% (QA)

It seems like youve provided a Java method for performing an insertion sort algorithm However the co... View the full answer