Question

Consider the Java program below to sort an array A in an ascending order. M, N, and K are positive integers, and A is an array of N nonnegative integers where 0 < A[i] < M for all i e {0,..., N -1}. In this program, list is a class of an integer list with the following methods. 1st.size(): returns the number of elements in the list lst 1st.get(i): returns the element at the i-th position in the list lst (the position number starts from 0) 1st.insert(i, x): inserts x to the list lst at the i-th position. B is an array of size K, whose elements are all initialized to empty lists. Suppose that the execution time of each of the above methods is constant. You can ignore overflow errors. 1 void mysort(int M, int N, int K, (int i = 0; i < N; it+) А [i] * к / M; int [] A, list [] B) { for 2 int m = int j = 0; for ; j < BCm].size(); j++) { if (AC1] Blm] .get(j)) break } 4 5 7 8 } B Cm.insert(j, A[i]); } 10 11 0; int i= 12 (int m 3D 0; m < К; m++) { for (int j = 0; j < B[m].size(); j++) { A Ci] for 13 14 х 1; 15 i =i + 1; } } 16 17 18 19 Answer the following questions. (1) Answer an appropriate expression to fill the blank X

Answer 1

Answer:- Appropriate expression to fill the blank is b[m].get(j)

here we need to store the all elements of each list in array B in array A  

code:-

void mysort(int M,int N,int K,int[] A,list[] B){
   for(int i=0; i<N ;i++){
       int m=A[i] *K /M;
       int j=0;
       for(;j<B[m].size();j++){
           if(A[i] <=B[m].get(j)){
               break;
           }
       }
       B[m].insert(j,A[i]);
   }
   int i=0;
   for(int m=0;m<K;m++){
       for (int j=0;j<B[m].size();j++){
           A[i] = B[m].get(j);
           i=i+1;
       }
   }
}