7.10 Do either of the following modifications to the Shellsort routine coded in Figure 7.4 affect the worst-case running time?

a. Before line 11, subtract one from gap if it is even.

b. Before line 11, add one to gap if it is even.

Data Structures and Algorithm Analysis in Java (Chapter 7 , 10E - Missing Textbook Solution )

*Shellsort, using Shell's (poor) increments. *Oparam a an array of Comparable items 3 5 public stat 6 void shellsort( AnyType a) ic > int j; 10 for( int gap a.length / 2; gap > 0; gap /= 2 ) for( int i gap; i