Empirical Study of Schelsort
Abstract
This Thesis Empirically Studies .The Average Tunning Time Characteristics of the Shellscrt Algorithm, and Then Determines What Tne Optimum Initial Increment Should Be For Two of the More Widely Used Sequences of Increments. A Shellsort Algorithm Due to Pratt, with an Average Running Time of Ocn*lg(N)**2) Is Also Investigated Briefly. A Proof Of the "worst Case" Permutation Using the Original Shellsort Algorithm Is given. Programs Were Written in Fcrtran, Compiled Using Fortran H, and Run on Ar Ibm 3701168 A11d On An Ibm 1130.
Collections
- OSU Theses [15752]