Implement Library Sort which is a version of Insertion Sort with gaps to speed up the computation.

If the pseudocode in Wikipedia (https://en.wikipedia.org/wiki/Library_sort) is not enough, you can download the research paper from (https://arxiv.org/pdf/cs/0407003.pdf).