二次排序时使用颗粒

2009 IEEE International Conference on Granular Computing Pub Date : 2009-09-22 DOI:10.1109/GRC.2009.5255124

Jean-David Hsu

{"title":"二次排序时使用颗粒","authors":"Jean-David Hsu","doi":"10.1109/GRC.2009.5255124","DOIUrl":null,"url":null,"abstract":"Quadratic sorting algorithms such as Selectionsort are valued for their simplicity, in-place property, and good performance on small input. On the other hand, a straightforward Mergesort is optimal, but has a linear space requirement. This paper explores the use of sorted granules built using Mergesort with bounded space requirement in order to increase the efficiency of an in-place stable quadratic sort.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"213 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"When quadratic sorts use granules\",\"authors\":\"Jean-David Hsu\",\"doi\":\"10.1109/GRC.2009.5255124\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Quadratic sorting algorithms such as Selectionsort are valued for their simplicity, in-place property, and good performance on small input. On the other hand, a straightforward Mergesort is optimal, but has a linear space requirement. This paper explores the use of sorted granules built using Mergesort with bounded space requirement in order to increase the efficiency of an in-place stable quadratic sort.\",\"PeriodicalId\":388774,\"journal\":{\"name\":\"2009 IEEE International Conference on Granular Computing\",\"volume\":\"213 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Conference on Granular Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GRC.2009.5255124\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Granular Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GRC.2009.5255124","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

二次排序算法(如Selectionsort)因其简单性、就地属性和在小输入下的良好性能而受到重视。另一方面，直接的归并排序是最优的，但有线性空间要求。为了提高原地稳定二次排序的效率，本文探讨了利用有界空间要求的归并排序构建的排序颗粒。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

When quadratic sorts use granules

Quadratic sorting algorithms such as Selectionsort are valued for their simplicity, in-place property, and good performance on small input. On the other hand, a straightforward Mergesort is optimal, but has a linear space requirement. This paper explores the use of sorted granules built using Mergesort with bounded space requirement in order to increase the efficiency of an in-place stable quadratic sort.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 IEEE International Conference on Granular Computing

自引率

0.00%

发文量