{"version":"1.0","type":"link","title":"Library sort - Newikis","description":"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:","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}