library sort

/L AY1 B R EH0 R IY0 S AO0 R T/
noun
  1. 1

    (computing theory) A form of insertion sort that leaves gaps between elements to accelerate subsequent insertions.