Show simple item record

dc.contributor.advisorChandler, John P.
dc.contributor.authorYu, Hong-Lee
dc.date.accessioned2015-08-21T20:37:36Z
dc.date.available2015-08-21T20:37:36Z
dc.date.issued1984-12-01
dc.identifier.urihttps://hdl.handle.net/11244/16144
dc.description.abstractThis 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.formatapplication/pdf
dc.languageen_US
dc.publisherOklahoma State University
dc.rightsCopyright 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.titleInvestigations of Shellsort
dc.typetext
dc.contributor.committeeMemberGrace, D.W.
dc.contributor.committeeMemberFolk, Michael J.
osu.filenameThesis-1984-Y94i.pdf
osu.accesstypeOpen Access
dc.description.departmentComputing and Information Science
dc.type.genreThesis


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record