冒泡排序算法优化分析

Wang Min
{"title":"冒泡排序算法优化分析","authors":"Wang Min","doi":"10.1109/IFITA.2010.9","DOIUrl":null,"url":null,"abstract":"Based on the analysis of the traditional bubble sort algorithm, this paper proposes two bidirectional bubble sort algorithm design ideas. After giving C language description of the three algorithms, the paper tests the new algorithms, analyzes comparatively the time complexity and space complexity of the three algorithms, and summarizes such a conclusion that the first new algorithm has the same average time complexity and space complexity as the original algorithm, while the second is time efficient than the original one, and thus truly reaches the optimization purpose.","PeriodicalId":393802,"journal":{"name":"2010 International Forum on Information Technology and Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":"{\"title\":\"Analysis on Bubble Sort Algorithm Optimization\",\"authors\":\"Wang Min\",\"doi\":\"10.1109/IFITA.2010.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Based on the analysis of the traditional bubble sort algorithm, this paper proposes two bidirectional bubble sort algorithm design ideas. After giving C language description of the three algorithms, the paper tests the new algorithms, analyzes comparatively the time complexity and space complexity of the three algorithms, and summarizes such a conclusion that the first new algorithm has the same average time complexity and space complexity as the original algorithm, while the second is time efficient than the original one, and thus truly reaches the optimization purpose.\",\"PeriodicalId\":393802,\"journal\":{\"name\":\"2010 International Forum on Information Technology and Applications\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"31\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Forum on Information Technology and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IFITA.2010.9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Forum on Information Technology and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IFITA.2010.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31

摘要

在分析传统气泡排序算法的基础上,提出了两种双向气泡排序算法的设计思路。在对三种算法进行C语言描述后,对新算法进行了测试,对比分析了三种算法的时间复杂度和空间复杂度,总结出第一种新算法与原算法具有相同的平均时间复杂度和空间复杂度,而第二种新算法比原算法具有更高的时间效率,从而真正达到了优化的目的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Analysis on Bubble Sort Algorithm Optimization
Based on the analysis of the traditional bubble sort algorithm, this paper proposes two bidirectional bubble sort algorithm design ideas. After giving C language description of the three algorithms, the paper tests the new algorithms, analyzes comparatively the time complexity and space complexity of the three algorithms, and summarizes such a conclusion that the first new algorithm has the same average time complexity and space complexity as the original algorithm, while the second is time efficient than the original one, and thus truly reaches the optimization purpose.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信