Problem
1. Give a specialized version of distribution counting for sorting files where elements have only one of two values (either x or y).
2. Experiment with different increment sequences for Shellsort: find one that runs faster than the one given for a random file of 1000 elements.