1. Find out what happens when you use the Partition Workshop applet on 100 inversely sorted bars. Is the result almost sorted?
2. Modify the shellSort.java program (Listing 7.1) so it prints the entire contents of the array after completing each n-sort. The array should be small enough so its contents fit on one line. Analyze these intermediate steps to see if the algorithm is operating the way you think should.