List the resulting array after each iteration of the outer loop of the insertion sort algorithm. Indicate the number of character-to-character comparisons made for each iteration (line 06 of the Insertion Sort algorithm). Sort the following array of characters into alphabetical order: C QRBPDX. 01 public static void insertionSort (char[] a) { 02 int n = a.length; for ( int i = 1; i < n; i++ ) { for ( int j if ( a[j-1] > a[j] ) { exchange (a, j-1, j); } else break; } 03 %3D 04 05 = i; j > 0; j-- ) { 06 07 08 09 10 } 11 12 private static void exchange (char [] a, int i, int j) { 13 // exchange the value at index i with the value at index j 14 char temp = a[i]; 15 a[i] alj]; %3D a[j] } 16 temp; %3D 17

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.