S. Budhani, Naveen Tewari, Mukesh Joshi, Kshitij Kala
{"title":"快速排序算法:将快速排序的时间复杂度提升到线性对数","authors":"S. Budhani, Naveen Tewari, Mukesh Joshi, Kshitij Kala","doi":"10.1109/iccakm50778.2021.9357725","DOIUrl":null,"url":null,"abstract":"Quick Sort is a famous algorithm. It was the fastest algorithm at one point in time. However, sometimes it can give polynomial time complexity. The only thing that is important in this algorithm is the selection of Pivot Element. In this paper, we proposed a new algorithm, which is based on Quick Sort, and through our testing, we conclude that this algorithm is giving good results for small as well as large data sets.","PeriodicalId":165854,"journal":{"name":"2021 2nd International Conference on Computation, Automation and Knowledge Management (ICCAKM)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Quicker Sort Algorithm: Upgrading time complexity of Quick Sort to Linear Logarithmic\",\"authors\":\"S. Budhani, Naveen Tewari, Mukesh Joshi, Kshitij Kala\",\"doi\":\"10.1109/iccakm50778.2021.9357725\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Quick Sort is a famous algorithm. It was the fastest algorithm at one point in time. However, sometimes it can give polynomial time complexity. The only thing that is important in this algorithm is the selection of Pivot Element. In this paper, we proposed a new algorithm, which is based on Quick Sort, and through our testing, we conclude that this algorithm is giving good results for small as well as large data sets.\",\"PeriodicalId\":165854,\"journal\":{\"name\":\"2021 2nd International Conference on Computation, Automation and Knowledge Management (ICCAKM)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 2nd International Conference on Computation, Automation and Knowledge Management (ICCAKM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/iccakm50778.2021.9357725\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 2nd International Conference on Computation, Automation and Knowledge Management (ICCAKM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iccakm50778.2021.9357725","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Quicker Sort Algorithm: Upgrading time complexity of Quick Sort to Linear Logarithmic
Quick Sort is a famous algorithm. It was the fastest algorithm at one point in time. However, sometimes it can give polynomial time complexity. The only thing that is important in this algorithm is the selection of Pivot Element. In this paper, we proposed a new algorithm, which is based on Quick Sort, and through our testing, we conclude that this algorithm is giving good results for small as well as large data sets.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
