Library Sort is a variant of insertion sort that leaves gaps between elements to speed up insertions, making it faster than standard insertion sort for large datasets.
Paradigm
Comparison / Insertion-Based
Author
Andrew C.-C. Yao
Tier
Time Complexity
Best
Avg
Worst
Space
O(n)
Properties