Consider The Following Code Snippet Which Implements The Shell #707

Consider the following code snippet, which implements the Shell sort algorithm.</p> <pre><code class="language-c"> shellSort( int elements[], int num_elements , int incrmnts[], int num_incrmnts) { int incr, j, k, span, y; for(incr = 0; incr ;&lt num_incrmnts; incr++) { span = incrmnts[incr]; data-structure-questions-answers-shell-sort for( j = span; j < num_elements; j++) { k = j; y = elements[j]; while (________ ) { elements [ k] = elements[k - span]; k = k - span; } elements[k] = y; } } </code></pre> <p>Which condition will correctly implement the while loop?

This multiple choice question (MCQ) is related to the book/course gs gs122 Data Communication and Computer Network. It can also be found in gs gs122 Sorting - Shell Sort - Quiz No.2.

 shellSort( int elements[], int num_elements , int incrmnts[], int num_incrmnts) { int incr, j, k, span, y; for(incr = 0; incr ;< num_incrmnts; incr++) { span = incrmnts[incr]; data-structure-questions-answers-shell-sort for( j = span; j < num_elements; j++) { k = j; y = elements[j]; while (________ ) { elements [ k]  = elements[k - span]; k = k - span; } elements[k] = y; } }