{"version":"1.0","type":"link","title":"Smoothsort - Newikis","description":"In computer science, smoothsort is a comparison-based sorting algorithm. A variant of heapsort, it was invented and published by Edsger Dijkstra in 1981. Like heapsort, smoothsort is an in-place algorithm with an upper bound of O(n log n) operations (see big O notation). Like heapsort, smoothsort…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://upload.wikimedia.org/wikipedia/commons/a/a5/Smoothsort.gif","thumbnail_width":295,"thumbnail_height":226}