Please help me fill in the blank

Question

Our own �innovative� Chunk Sort algorithm is designed for sorting arrays that consist of a few presorted chunks. The idea is to find the next chunk and merge it with the already sorted beginning segment of the array. We will implement this algorithm iteratively, without recursion.
     Fill in the blanks in the following merge method:
* Precondition: 0 <= m <= n
* m == 0 or a[0] <= ... <= a[m-1]
* n == m or a[m] <= ... <= a[n-1]
* Postcondition: the values a[0] .. a[n-1] are arranged
* in the ascending order
private static void merge(int a[], int m, int n)
// If any of the two segments is empty, do nothing:
int i = 0, j = m; // starting indices into the two segments
// Allocate a temporary array temp to hold n elements
int k = 0; // starting index into the temporary array
while (i < m && j < n)
if ( ______________________ )
else
k++;
// Copy remaining elements:
while (i < m)
k++;
while (j < n)
k++;
// Copy temp back to a:
for ( _____________________________________ )

Answer 1

Your teacher needs to teach you to Teach
Yourself[b]. People can't always tell you the answer
to everything. There comes a time in life when you
just have to break down and fire up that brain cell.
Not quite, you need at least two neurones to make a synapse. Unless, we talking about extrapyramidal pathways. Then termination on peripheral skeletal muscle is what is going on. Certainly, that is required in this case as the OP doesn't appear motivated enough to pick up a book.