| dc.contributor.advisor | Chandler, J. P. | |
| dc.contributor.author | Bauer, Bruce Lee | |
| dc.date.accessioned | 2016-03-02T18:31:41Z | |
| dc.date.available | 2016-03-02T18:31:41Z | |
| dc.date.issued | 1980-12-01 | |
| dc.identifier.uri | https://hdl.handle.net/11244/32094 | |
| dc.description.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. | |
| dc.format | application/pdf | |
| dc.language | en_US | |
| dc.publisher | Oklahoma State University | |
| dc.rights | Copyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material. | |
| dc.title | Empirical Study of Schelsort | |
| dc.type | text | |
| dc.contributor.committeeMember | Hedrick, G. E. | |
| dc.contributor.committeeMember | Grace, Donald W. | |
| osu.filename | Thesis-1980-B344e.pdf | |
| osu.accesstype | Open Access | |
| dc.description.department | Computing and Information Sciences | |
| dc.type.genre | Thesis | |
