一个基于完全图结构的排序算法

2011 IEEE International Conference on Computer Science and Automation Engineering Pub Date : 2011-06-10 DOI:10.1109/CSAE.2011.5952832

R. Pal

{"title":"一个基于完全图结构的排序算法","authors":"R. Pal","doi":"10.1109/CSAE.2011.5952832","DOIUrl":null,"url":null,"abstract":"Sorting is a well-known problem frequently used in many aspects in the world of computational applications. Sorting means arranging a set of records (or a list of keys) in some (increasing or decreasing) order. In this solution report, a complete graph structure based comparison sorting algorithm, CompleteGraphSort has been proposed that takes time Θ(n2) in the worst-case, where n is the number of records in the given list to be sorted.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"CompleteGraphSort: A complete graph structure based sorting algorithm\",\"authors\":\"R. Pal\",\"doi\":\"10.1109/CSAE.2011.5952832\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sorting is a well-known problem frequently used in many aspects in the world of computational applications. Sorting means arranging a set of records (or a list of keys) in some (increasing or decreasing) order. In this solution report, a complete graph structure based comparison sorting algorithm, CompleteGraphSort has been proposed that takes time Θ(n2) in the worst-case, where n is the number of records in the given list to be sorted.\",\"PeriodicalId\":138215,\"journal\":{\"name\":\"2011 IEEE International Conference on Computer Science and Automation Engineering\",\"volume\":\"78 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-06-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Conference on Computer Science and Automation Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSAE.2011.5952832\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Computer Science and Automation Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSAE.2011.5952832","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

排序是一个众所周知的问题，经常在计算应用领域的许多方面使用。排序是指按某种(递增或递减)顺序排列一组记录(或键列表)。在这个解决方案报告中，提出了一种基于完全图结构的比较排序算法，CompleteGraphSort，在最坏情况下花费时间Θ(n2)，其中n是给定列表中要排序的记录数。

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

查看原文本刊更多论文

CompleteGraphSort: A complete graph structure based sorting algorithm

Sorting is a well-known problem frequently used in many aspects in the world of computational applications. Sorting means arranging a set of records (or a list of keys) in some (increasing or decreasing) order. In this solution report, a complete graph structure based comparison sorting algorithm, CompleteGraphSort has been proposed that takes time Θ(n2) in the worst-case, where n is the number of records in the given list to be sorted.

求助全文

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

来源期刊

2011 IEEE International Conference on Computer Science and Automation Engineering

自引率

0.00%

发文量