Smoothsort
id:
smoothsort-287-10175230
title:
Smoothsort
text:
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, but it is not a stable sort. The advantage of smoothsort is that it comes closer to O(n) time if the input is already sorted to some degree, whereas heapsort averages O(n log n) regardless of the initial sorted state.
brand slug:
wiki
category slug:
encyclopedia
description:
Comparison-based sorting algorithm
original url:
https://en.wikipedia.org/wiki/Smoothsort
date created:
date modified:
2024-04-18T05:19:37Z
main entity:
{"identifier":"Q1714823","url":"https://www.wikidata.org/entity/Q1714823"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/a/a5/Smoothsort.gif","width":295,"height":226}
fields total:
13
integrity:
15