{"version":"1.0","type":"link","title":"Block sort - Newikis","description":"Block sort, or block merge sort, is a sorting algorithm combining at least two merge operations with an insertion sort to arrive at O(n log n) (see Big O notation) in-place stable sorting time. It gets its name from the observation that merging two sorted lists, A and B, is equivalent to breaking A…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://upload.wikimedia.org/wikipedia/commons/9/9f/Block_sort_with_numbers_1_to_16_%28thumb%29.gif","thumbnail_width":343,"thumbnail_height":240}