Minimal mergesort.

dc.contributor.author	Takaoka, Tadao
dc.date.accessioned	2014-10-06T01:50:42Z
dc.date.available	2014-10-06T01:50:42Z
dc.date.issued	1997	en
dc.description.abstract	We present a new adaptive sorting algorithm, called minimal merge sort, which merges the ascending runs in the input list from shorter to longer, that is, merging the shortest two lists each time. We show that this algorithm is optimal with respect to the new measure of presortedness, called entropy.	en
dc.identifier.other	TR-COSC 01/97	en
dc.identifier.uri	http://hdl.handle.net/10092/9676
dc.language.iso	en
dc.publisher	University of Canterbury. Computer Science and Software Engineering	en
dc.relation.isreferencedby	NZCU	en
dc.rights	Copyright Tadao Takaoka	en
dc.rights.uri	https://canterbury.libguides.com/rights/theses	en
dc.subject	adaptivesort	en
dc.subject	minimal mergesort	en
dc.subject	ascending runs	en
dc.subject	entropy	en
dc.subject.anzsrc	Field of Research::08 - Information and Computing Sciences::0802 - Computation Theory and Mathematics::080201 - Analysis of Algorithms and Complexity	en
dc.title	Minimal mergesort.	en
dc.type	Reports
uc.college	Faculty of Engineering	en

Now showing 1 - 1 of 1