Smart Bubble Sort:A Novel and Dynamic Variant of Bubble Sort Algorithm
作者机构：College of Computing and InformaticsSaudi Electronic UniversityRiyadhSaudi Arabia
出 版 物：《Computers, Materials & Continua》 (计算机、材料和连续体（英文）)
年 卷 期：2022年第71卷第6期
页 面：4895-4913页
核心收录：
学科分类：08[工学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）]
主 题：Sorting algorithms smart bubble sort footprint dynamic footprint time complexity asymptotic analysis
摘 要：In the present era,a very huge volume of data is being stored in online and offline *** houses,research,medical as well as healthcare organizations,and academic institutions store data in databases and their subsequent retrievals are performed for further *** the required data from a given database within the minimum possible time is one of the key factors in achieving the best possible performance of any computer-based *** the data is already sorted,finding or searching is comparatively *** real-life scenarios,the data collected from different sources may not be in sorted *** algorithms are required to arrange the data in some order in the least possible *** this paper,I propose an intelligent approach towards designing a smart variant of the bubble sort algorithm.I call it Smart Bubble sort that exhibits dynamic footprint:The capability of adapting itself from the average-case to the best-case *** is an in-place sorting algorithm and its best-case time complexity isΩ(n).It is linear and better than bubble sort,selection sort,and merge *** averagecase and worst-case analyses,the complexity estimates are based on its static footprint *** complexity in worst-case is O(n2)and in average-case isΘ(n^(2)).Smart Bubble sort is capable of adapting itself to the best-case scenario from the average-case scenario at any subsequent stages due to its dynamic and intelligent *** Smart Bubble sort outperforms bubble sort,selection sort,and merge sort in the best-case scenario whereas it outperforms bubble sort in the average-case scenario.
维普期刊数据库