Library sort

Library sort, or gapped insertion sort is a sorting algorithm that uses an insertion sort, but with gaps in the array to accelerate subsequent insertions. The name comes from an analogy:

The algorithm was proposed by Michael A. Bender, Martín Farach-Colton, and Miguel Mosteiro in 2004 and was published in 2006.

单词	Library sort
释义	Library sort 英语百科 Library sort Library sort, or gapped insertion sort is a sorting algorithm that uses an insertion sort, but with gaps in the array to accelerate subsequent insertions. The name comes from an analogy: The algorithm was proposed by Michael A. Bender, Martín Farach-Colton, and Miguel Mosteiro in 2004 and was published in 2006.
随便看	Patent thickets patent tribunal Patent troll Patent Trolls patent twist patent urachus patent velvet Patent violation patent vitellinc duct patent vitelline duct patent vitellineduct patent vitellointestinal duct patent watching search patent white board patent work patent work in enterprises patent working patent work system patenty patent yellow pateque Pater. pater patera pateraite