dc.contributor.advisor | Chandler, John P. | |
dc.contributor.author | Yu, Hong-Lee | |
dc.date.accessioned | 2015-08-21T20:37:36Z | |
dc.date.available | 2015-08-21T20:37:36Z | |
dc.date.issued | 1984-12-01 | |
dc.identifier.uri | https://hdl.handle.net/11244/16144 | |
dc.description.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. | |
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 | Investigations of Shellsort | |
dc.type | text | |
dc.contributor.committeeMember | Grace, D.W. | |
dc.contributor.committeeMember | Folk, Michael J. | |
osu.filename | Thesis-1984-Y94i.pdf | |
osu.accesstype | Open Access | |
dc.description.department | Computing and Information Science | |
dc.type.genre | Thesis | |