| dc.contributor.author | BRADY, MICHAEL HAYES | |
| dc.date.accessioned | 2007-02-19T19:46:24Z | |
| dc.date.available | 2007-02-19T19:46:24Z | |
| dc.date.created | March 31, 2005 | en |
| dc.date.issued | 2005 | |
| dc.date.submitted | 2005 | en |
| dc.identifier.citation | Brady, Mike , 'Runsort' - An Adaptive Mergesort for Prolog, Dublin, TCD Computer Science Department, March 31, 2005, 2005, (TCD-CS-2005-34) | en |
| dc.identifier.other | N | |
| dc.description | PUBLISHED | en |
| dc.description.abstract | This note describes a novel list-sorting method for Prolog which is stable, has O(n log n) worst-case
behaviour and O(n) best-case behaviour. The algorithm is an adaptive variant of bottom-up mergesort
using so-called long runs of preexisting order to improve efficiency; accordingly we have called it `runsort?.
Runsort compares favourably with samsort, and a modification to samsort is suggested. | en |
| dc.format.extent | 218483 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | en |
| dc.publisher | TCD Computer Science Department | en |
| dc.relation.ispartofseries | Computer Science Technical Report | en |
| dc.relation.ispartofseries | TCD-CS-2005-34 | en |
| dc.rights | Y | en |
| dc.subject | Prolog | en |
| dc.title | 'Runsort' - An Adaptive Mergesort for Prolog | en |
| dc.type | Technical Report | en |
| dc.type.supercollection | scholarly_publications | en |
| dc.identifier.rssuri | http://www.cs.tcd.ie/publications/tech-reports/reports.05/TCD-CS-2005-34.pdf | |
| dc.identifier.uri | http://hdl.handle.net/2262/5321 | |
