✦ LIBER ✦

An improved Shellsort algorithm

✍ Scribed by Liu Renren

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 345 KB
Volume: 188
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00100-x

No coin nor oath required. For personal study only.

✦ Synopsis

Shellsort algorithm is a refinement of the straight insertion soIt. Each pass of this method sorts all items which are h-position apart by straight insertion sort, and the place of the item to be inserted in is determined by comparing items which are already ordered from right to left.

In this paper, straight insertion of h-step length is improved to binary insertion of h-step length. So the number of comparison is reduced from O(n?) to O(n log2 n).

📜 SIMILAR VOLUMES

Improved upper bounds on shellsort

✍ Janet Incerpi; Robert Sedgewick 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 835 KB

The Worst Case in Shellsort and Related

The Worst Case in Shellsort and Related Algorithms

✍ B. Poonen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 830 KB

An improved LLL algorithm

✍ Franklin T. Luk; Daniel M. Tracy 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 145 KB

The LLL algorithm has received a lot of attention as an effective numerical tool for preconditioning an integer least squares problem. However, the workings of the algorithm are not well understood. In this paper, we present a new way to look at the LLL reduction, which leads to a new implementation

An improved block-interchange algorithm

✍ John L Mohammed; Carlos S Subi 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 487 KB

An improved vertex enumeration algorithm

✍ M.E. Dyer; L.G. Proll 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 1003 KB

An improved phase-splitting algorithm

✍ F.F.Y. Walraven; P.V. Van Rompay 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 615 KB