Wikipedia

Adaptive heap sort: Difference between revisions

Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
Citation bot (talk | contribs)
Bots
5,867,392 edits
Add: s2cid, author pars. 1-1. Removed URL that duplicated unique identifier. Removed parameters. Some additions/deletions were actually parameter name changes. | You can use this bot yourself. Report bugs here. | Activated by AManWithNoPlan | All pages linked from User:AManWithNoPlan/sandbox2 | via #UCB_webform_linked
Improve grammar
Line 94:
 
== Drawbacks ==
Despite decades of researchesresearch, there's still a gap between the theory of adaptive sortingheap sort and theits actualpractical computinguse. practiceBecause still exists, leading to several drawbacks of thisthe algorithm. Due to themakes use of Cartesian trees and the pointer manipulationsmanipulation, problemsit regardinghas low cache -efficiency and high memory requirements arose, both of which deteriorate the performance of any implementation of adaptive heapsortimplementations.<ref name=":2" />
 
==See also==
Retrieved from "https://en.wikipedia.org/wiki/Adaptive_heap_sort"