Investigations of Shellsort
Abstract
This thesis investigates many aspects of Shellsort. A large number of experiments were conducted and best sequences, which seem to minimize the number of comparisions for different sizes of lists and number of passes, are given. A proof that shows the average behavior of the original Shellsort, when N is a power of 2, is also presented.
Collections
- OSU Theses [15752]