About this document
Understanding Shellsort Algorithm by soundharya03 is a document available to read on EtoBox.
Shellsort is a generalization of insertion sort that improves performance by allowing elements to jump farther ahead in the array during sorting. It works by first sorting array elements spaced far apart, then reducing the spacing between elements and sorting again, until reaching normal insertion sort spacing of adjacent elements. While its overall runtime is unknown, experiments show it is faster than O(n^2) time of basic insertion sort, likely around O(n^3/2) or O(n^7/6) time.
- Author
- soundharya03
- Language
- EN