• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    Smart Bubble Sort:A Novel and Dynamic Variant of Bubble Sort Algorithm

    2022-08-23 02:17:38MohammadKhalidImamRahmani
    Computers Materials&Continua 2022年6期

    Mohammad Khalid Imam Rahmani

    College of Computing and Informatics,Saudi Electronic University,Riyadh,Saudi Arabia

    Abstract: In the present era, a very huge volume of data is being stored in online and offline databases.Enterprise houses, research, medical as well as healthcare organizations, and academic institutions store data in databases and their subsequent retrievals are performed for further processing.Finding 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 application.If the data is already sorted,finding or searching is comparatively faster.In real-life scenarios,the data collected from different sources may not be in sorted order.Sorting algorithms are required to arrange the data in some order in the least possible time.In 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 scenario.It 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 sort.In averagecase and worst-case analyses,the complexity estimates are based on its static footprint analyses.Its complexity in worst-case is O(n2)and in average-case is Θ(n2).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 nature.The 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.

    Keywords: Sorting algorithms; smart bubble sort; footprint; dynamic footprint;time complexity;asymptotic analysis

    1 Introduction

    The digital world is producing a huge amount of data from almost every field of life and databases are storing those data in computer-based information systems.As said by Knuth in his book [1],“virtually every important aspect of programming arises somewhere in the context of sorting or searching”, many improvements have been conducted in sorting and searching algorithms since the advent of programming[2,3].Sorting various records in different application domains consumes 25%to 50% of the computational resources worldwide as mentioned in [2,4].It is argued that a single sorting algorithm cannot perform well in every situation that is why for a given scenario,an appropriate sorting algorithm must be applied[5].For example,bubble sort,insertion sort,and selection sort are best suited to small input data whereas quick sort and merge sort perform better when applied to a large volume of data [2,5–9].Researchers have been working to design more efficient algorithms for decades.Currently, new sorting and searching algorithms, as well as efficient modifications,have been proposed by the computer science community.In this connection, Mohammed et al.[10]developed a Bidirectional Conditional Insertion Sort algorithm, which demonstrated O(n1.5) time complexity in average case scenarios for normal and uniform distributed data.Appiah et al.[11]have designed a new algorithm:Magnetic Bubble sort with enhancements of bubble sort in the case where redundancies occur in the list.Alotaibi et al.[12] have proposed a new in-place sorting algorithm,which performs better than bubble sort and selection sort but similar to Insertion sort.Ranaa et al.[13]have developed a new approach called MinFinder to overcome some of the weaknesses of some conventional algorithms in terms of stability,computational time,and complexity analysis.Cheema et al.[14] have employed a hybrid approach that takes a minimum number of comparisons with less time and space complexity to sort example data with merge sort and bi-directional bubble sort approaches.Faujdar et al.[15] have evaluated the existing sorting algorithms using repeated data considering the average-case, worst-case, and best-case scenarios.Sodhi et al.[16] have designed Enhanced Insertion sort that achieved O(n) worst-case time complexity and O(n1.585) average time complexity showing better performance compared to insertion sort.

    In this article,a novel and dynamic variant of bubble sort is being proposed,which I call Smart Bubble sort.In the best-case scenario,our proposed algorithm will iterate only once and will terminate when it detects that the data is already in the sorted order.It has the capability of transforming itself from an average-case scenario to the best-case scenario when it detects that the remaining elements are now sorted after bubbling up some of the elements to their sorted positions during the sorting procedure.I have devised the term dynamic footprint to refer to this concept.The remaining of the paper is structured as follows.In Section 2,preliminary concepts have been discussed.In Section 3,the proposed algorithm is introduced and elaborated along with an example illustration of the working procedure followed by a detailed asymptotic analysis.In Section 4,a description of the new dataset is provided,the experimental setup is explained,and empirical results have been highlighted.In Section 5,conclusions are drawn at the end of the article.

    2 Preliminaries

    Searching and sorting of database entries are the two direct applications of sorting algorithms.Broader applications of sorting techniques are for the solution of many complex problems in the fields of information retrieval [5,17–19], image retrieval [20–25], image processing [26,27], database systems, networking [28], management information systems, decision support systems, operations research and optimization problems [29–31].Similarly, sorting algorithms play an important role in educational subjects like design&analysis of algorithms and data structures&programming where the problems require the use of syntax/semantics of every important programming construct related to any programming language.Bubble sort,selection sort,and exchange sort are best suited to data samples of small to medium sizes.These algorithms are comparison-based sorting algorithms;therefore,their lower bound performance is proven to be O(nlogn).A small number of algorithms exist,which claim to have linear bound,however,they are designed for some special cases of input data.Sorting algorithms with O(n)time complexity are considered best performing algorithms.On the other hand,algorithms with O(n2)time complexity are thought to be bad performers whereas algorithms with O(nlogn)time complexity are identified as good algorithms.

    2.1 Performance Measurement and Analysis of Sorting Algorithms

    The performance of an algorithm is estimated in terms of computational complexity that is measured as its time complexity and space complexity.The time complexity of an algorithm is more important because the availability of sufficiently large memory space in the current era of technology is not a big deal.The efficiency of an algorithm is always expressed as a function of its input size as T(n)or S(n);where n is the input size,T(n)and S(n)are time and space complexities,respectively.

    The relative efficacy of sorting algorithms can be characterized by the order of growth of their running times.While calculating the exact running times of a very large volume of input data, the input itself dominates the coefficients and other lower-order terms.For measuring the efficiency of algorithms and comparing the performance of two or more sorting algorithms,the order of growth of their running times is significantly used.However,this technique is not useful when the order of growth of two or more algorithms is the same.On such occasions,the determination of the exact running time of the algorithms is essential which I have done in this article.Asymptotic efficiency of an algorithm refers to the estimation of the order of growth of the running time for very large inputs[7].That is,I am concerned with how the running time of an algorithm increases with the size of the input in the limit, as the size of the input increases without bound.Usually, an algorithm that is asymptotically more efficient will be the best choice for all but very small inputs.To compare different algorithms for the problem of sorting,I break the analysis of algorithms into three different cases so that I can formulate a way that can provide a better estimate of the resources required.In the first case known as the best-case,the minimum number of computational steps are taken by the algorithm because the input data is sorted in the same order which would be the expected outcome of the algorithm.In the second case known as the average case,the average number of computational steps are taken for the algorithm.This is the most complex kind of analysis that is often based on the probability theory because the input data is randomly collected without any explicit ordering.In the third case known as the worst-case,the maximum number of computational steps are taken by the algorithm.This case is analyzed most often because the maximum time complexity of the algorithm matters the most where the input data is sorted in reverse order.

    2.2 Internal Sorting Algorithms

    Internal sorting algorithms maintain the entire sequence of data into the main memory of the computer.These algorithms are based on a comparison of items and are further grouped into simple or complex categories.The simple ones are mainly iterative,simple to understand,and easy to implement but their time complexity is more i.e., O(n2).Bubble sort, Selection sort, and Insertion sort are in this category.The complex ones are mainly divide-and-conquer based and difficult to implement but their time complexity is less i.e.,O(nlogn).Quicksort,Merge sort,and Heapsort algorithms are in this category.

    3 The Proposed Algorithm

    In this section, I have first identified the problem of the bubble sort algorithm with its detailed asymptotic analysis.Next,I described our idea about the Smart Bubble sort algorithm and provided its detailed asymptotic analysis with a proper derivation of best case, worst case, and average case notations.A sorting algorithm consists of instructions arranged in a sequence that puts the input data elements in an ordered sequence.Designing an efficient sorting algorithm is necessary for the optimal performance of different computer applications that require sorted data elements to smoothly perform their operations.Sorting algorithms are usually selected based on their computational requirements and ease of implementation.The efficiency of a comparison-based sorting algorithm can be enhanced by reducing either the number of comparison operations or swapping operations or both.

    3.1 Problem with Bubble Sort

    I start with the formal description of the Bubble sort algorithm in terms of its steps as below:

    BUBBLE-SORT(A,n)

    A is an array of size n;each element of the array will be sorted after the algorithm gets terminated.

    Step 1.for i=1 to n-1 do

    Step 2.for j=1 to n–i-1 do

    Step 3.if A[j]>A[j+1]then

    Step 4.val=A[j]

    Step 5.A[j]=A[j+1]

    Step 6.A[j+1]=val

    It is well known that bubble sort is considered the slowest sorting algorithm because it performs the maximum number of comparisons without looking at the instance of input data.It fails to exploit the instance of input data in the best case and the average case.I have highlighted these phenomena in Figs.1 and 2 through simple and effective illustrations where the steps of bubble sort are shown on the left side and that of Smart Bubble sort are shown on the right side of the figures.

    Figure 1:Illustration of the footprint of smart-bubble-sort in case of sorted data

    In Fig.1, I can see that the data is already sorted.However, bubble sort will go through all the required passes and steps even if the data is already sorted.On the other hand, Smart Bubble sort will perform only one iteration(Please see Iteration 1 of Pass 1 in Fig.1)and will not continue once it detects that the data is already sorted.Similarly,the data instance in Fig.2 is nearly sorted.Again,bubble sort will go through all the passes and steps to complete its operation blindly.After bubbling up the element 20 to the highest position of the array,the remaining elements,1,4,6,8,and 14 are now in their proper positions of the sorted array at the end of Iteration 2 of Pass 2.Bubble sort is not able to exploit this advantage.It will complete all the remaining iterations and steps blindly doing no further swap operation.However, Smart Bubble sort will exploit this situation to its advantage through its dynamic footprint detection capability and will terminate without performing the remaining iterations and passes.

    Figure 2:Illustration of the dynamic footprint of smart-bubble-sort in case of nearly sorted data

    3.2 Analysis of Bubble Sort

    Analysis of the algorithms is shown as the general expression of the cost function in terms of the input data size in the form of asymptotic notationsΩ(best case),Θ(average case), and O(worst case).The computational complexity for individual steps is provided in Tab.1 that corresponds to the algorithm provided in BUBBLE-SORT(A,n).

    Table 1: Analysis of bubble sort algorithm

    3.2.1 Best Case Analysis

    The best case of input instance for the sorting algorithms occurs when the elements are sorted in the same order that the algorithm will produce.Therefore,T(n)for the best case can be derived as below:

    Since Eq.(1)is a quadratic equation,the time complexity of Bubble sort in best-case is O(n2).

    3.2.2 Worst Case Analysis

    The worst case of input instance for the sorting algorithms occurs when the elements are sorted in the opposite order that the algorithm will produce.Therefore,T(n)for the worst case can be derived as below:

    3.2.3 Average Case Analysis

    The average case of input instance for the sorting algorithms occurs when the elements are arranged in random order.This is the most expected case.Therefore, T(n) for the average case can be derived as below:

    Since Eq.(3)is a quadratic equation,the algorithm’s time complexity in the average case is O(n2).

    3.3 The Concept of Smart Bubble Sort

    In this section,I have materialized the idea of our proposed Smart Bubble sort algorithm.I begin with the description of the algorithm followed by its asymptotic analysis.

    The bubble sort algorithm usesn-1 passes for sortingnnumbers.In each pass, the number of iterations to compare the key values are(n-pass number).For controlling the passes of the algorithm,the outerforloop is used.The innerforloop is used for making the actual comparisons for swapping the adjacent key values whenever they are found out of order as shown in BUBBLE-SORT(A, n).Bubble sort is considered the slowest algorithm in average-case and best-case scenarios.But its bestcase, as well as average-case running times, can be improved by doing some smart enhancements in the classical bubble sort algorithm.The bubble sort does unnecessary work even if the input data is already sorted as demonstrated in Figs.1 and 2.It keeps on comparing the items blindly even if the remaining items are already sorted thereby losing the opportunity of exploiting the scenario for terminating it quickly whereas there is no need of running the remaining passes.The Smart Bubble sort algorithm exploits the scenarios and terminates quickly giving much rise in its performance against not only bubble sort but other sorting algorithms as well.In case,the algorithm completes a pass for the remaining elements of the array without detecting any swapping of adjacent elements,it is concluded that the array is sorted and so the algorithm should stop immediately.Similarly,the Smart Bubble sort can transform the average-case into best-case whenever it detects that no swap has been performed at any stage of the algorithm execution as shown in Figs.1 and 2.

    To implement the Smart Bubble sort procedure,I have used a boolean variableflagto detect the swapping of elements.The variable will be set totrueat the beginning of every pass and if a swap is detected in that pass,it would be reset tofalse.If at the end of a pass,the variable is foundtrue,then it would be concluded that no swapping of elements has occurred and hence the algorithm is terminated immediately.

    A formal description of the Smart Bubble sort algorithm is given as follows where the order of sorting is considered as ascending order.

    Step 1.Forn-1number of passes,carry out each pass.

    Step 2.Bubble up the largest element to the top position.

    Step 3.If during the bubbling up no swap is encountered,Exit.

    Step 4.Else,carry out the next pass.

    The formal algorithm for Smart Bubble sort is provided in SMART-BUBBLE-SORT(A,n).

    SMART-BUBBLE-SORT(A,n)

    Ais an array of sizen;elements of the array will be sorted in increasing order after the algorithm gets terminated.

    Step 1.fori=1 ton–1 do

    Step 2.flag=true

    Step 3.forj=1 ton–i–1 do

    Step 4.ifA[j]>A[j+1]then

    Step 5.flag=false

    Step 6.val=A[j]

    Step 7.A[j]=A[j+1]

    Step 8.A[j+1]=val

    Step 9.ifflagthen

    Step 10.break

    The time complexity of Smart Bubble sort isΩ(n) in the best case, O(n2) in the worst case, andΘ(n2)in the average case.It is worth noting that the Smart Bubble sort is capable of converting itself from an average-case scenario to the best-case scenario as discussed earlier.This is because the Smart Bubble sort detects the dynamic footprint in its data instance during the execution of the algorithm well before the end of the execution.

    3.4 Analysis of Smart Bubble Sort

    Analysis of the algorithms is shown as the general expression of the cost function in terms of the input data size in the form of asymptotic notationsΩ(best case),Θ(average case), and O(worst case).The computational complexity for individual steps is provided in Tab.2 that corresponds to the algorithm provided in SMART-BUBBLE-SORT(A,n).

    Table 2: Analysis of smart bubble sort algorithm

    3.4.1 Best Case Analysis

    The best-case scenario for the algorithm arises when the input array is sorted in the same order in which the output is desired.The algorithm checks this scenario by using a boolean variableflag,which is initialized totrueat the beginning of the external for loop(for Passes).Inside the internal for loop(for comparison and swapping)at step 3 when any two adjacent elements are found out-of-order by the if-then structure(i.e.,ifA[j]>A[j+1])of step 4 then these elements are swapped and theflagvariable assumes afalsevalue.In case, the value of the variableflagis foundtrueby the if-then structure of step 9,it is concluded that the remaining elements of the array are already sorted.Therefore,the Smart Bubble sort algorithm should stop immediately.This is ensured through the break statement of step 10.As a result, the algorithm does the minimum possible work due to the ability to detect dynamic footprint smartly.

    Since the if-then structure of step 4 will never be satisfied in this case,steps 5 through 8 will not be contributing anything to the overall time complexity of the algorithm.Therefore,the total time taken by the algorithm is computed by taking the sum of the products of the corresponding time(cost)and repetition for the contributing steps only.Mathematically,the expression for the time complexity can be derived as follows:

    where,A=C3+C4,B=C1+C2+C3+C9+C10

    Since Eq.(4) is a linear equation, therefore, the coefficient of the highest order term and the constant term are neglected to get the asymptotic notation of the algorithm,which isΩ(n).Therefore,the time complexity of Smart Bubble sort in the best-case isΩ(n).

    3.4.2 Worst Case Analysis

    The worst case of an input instance for sorting algorithms occurs when the input array is sorted in descending order and the output is desired in ascending order or vice-versa.The algorithm will have to do the maximum work in this case.The for loop of step 1 is testedntimes withn-1 time for executing its body and one more time when the loop condition becomes false.Steps 2 and 9 will be executedn-1 time.Since each pair of adjacent elements will be out-of-order,the number of swapping will be equal to the number of comparisons.So,the if-then structure of step 9 will never be satisfied and as a result,the break statement of step 10 will never be executed.Steps 3 through 8 will be executed for the maximum possible number of times,which arefor the step 3 andfor the rest of the steps.Mathematically,the expression for the time complexity can be derived as follows:

    Since Eq.(5) is a quadratic equation, therefore, the coefficient of the highest order term and the lower order terms are neglected to get the asymptotic notation of the algorithm,which is O(n2).Therefore,the time complexity of Smart Bubble sort in the worst case is O(n2).

    3.4.3 Average Case Analysis

    The average case of input instance for the sorting algorithms occurs when the elements are arranged in random order.This is the most expected case.The algorithm might have to do as much work as in the worst case[7].However,I have safely assumed that only half of the adjacent elements are out-of-order.Therefore, the number of swapping will become almost half of the number of comparisons.Similar to the worst-case analysis, the for loop in step 1 is testedntimes and steps 2 and 9 will be executedn–1 time.Step 3 will be executed fortimes and steps 4 through 8 will be executed fortimes.Unlike the worst-case scenario, the if-then structure of step 9 may be satisfied at any successive pass after the first pass.When this happens,the footprint of the algorithm changes to the best-case scenario,and the break statement of step 10 is executed and as a result,the algorithm successfully terminates.This is the situation,which I call thedynamic footprintof the Smart Bubble sort.Thedynamic footprintis defined as the ability to convert the footprint from one case of input instance to another case of input instance.Therefore,the total time taken by the algorithm is computed by taking the sum of the products of the corresponding time(cost)and repetition for the contributing steps only.Mathematically,the expression for the time complexity can be derived as given below:

    Since Eq.(6) is a quadratic equation, therefore, the coefficient of the highest order term and the lower order terms are neglected to get the asymptotic notation of the algorithm,which isΘ(n2).Therefore,the time complexity of Smart Bubble sort in the average case isΘ(n2).

    4 Results and Discussion

    In this section, I have constructed a new dataset containing random, sorted, and reverse sorted data as input data to the algorithms.Then I have provided details about the experimental setup.Lastly,I have discussed the results.

    4.1 Dataset

    Using a perfect dataset is one of the important considerations for establishing an experimental setup for measuring the performance analysis of computer algorithms.In this paper, I have used datasets of randomly created positive integer values generated by a dedicated Java program, which are stored intextformat.The datasets are of 3 categories of sizes 500, 2500, 5000, 50000, 100000,625000,1250000,and 2500000.

    a.Random sets:Sets of the specified sizes were created in random order to analyze the average case scenario.

    b.Sorted sets:The Random sets were first sorted and then used for the analysis of the best-case scenario.

    c.Reverse Sorted sets:The Sorted sets were reversed and then used for the analysis of the worstcase scenario.

    I have designed a Java program that used the Random class along with its nextInt() method.This class was instantiated for calling the nextInt() method.The value of the argumentrangein the nextInt()method was given as 2147483647 to maintain as much uniqueness of elements in the data set as possible.

    Besides, I have created another similar dataset with approximately 50% sorted data items to provide evidence ofdynamic footprintdetection capability for which the results are provided in Section 4.2.4.

    4.2 Experimental Setup

    The proposed algorithm’s steps are written in a formal way suitable to be implemented in any programming language but its Java implementation is the most efficient one in terms of CPU time(measured in nanoseconds)and memory requirement[32,33].I have used IntelliJ IDEA version 11.0.9 with JDK 1.8.0_231 for implementing the algorithms and testing & validating the results.In our implementation, the variable,flagof type boolean is used to check if any swapping is made inside the inner for loop or not.A boolean variable may assume only two values;trueorfalse.So, its implementation requires just 1 bit of memory[34]whereas C/C++implementation[35]will use either short or int,which requires 2 to 4 bytes of memory.

    The experiments are performed on a 3.6 GHz Intel Core i9(9thgeneration)processor with 64 GB RAM,and Windows 10(64-bit OS)platform.

    4.2.1 Performance Analysis of Smart Bubble Sort on Sorted Data

    The experimental results for best-case analysis on sorted data are presented in Supplementary Tab.1 where the names of the sorting algorithms are given along the top row and the data sizes are arranged along the first column.The best-performing values are highlighted in blue.As evident from the obtained results,Smart Bubble sort is outperforming all the listed algorithms by a huge margin in terms of the number of comparisons,swapping,and CPU clock time.It can be noted down that from this point onward swapping will refer to merging operation in case of merge sort analysis.The growth of the Smart Bubble sort algorithm is linear to the size of the input data in the best-case scenario.Therefore,CPU clock time is the least.This is the edge of the Smart Bubble sort over bubble sort and the rest of the algorithms under consideration.This is because the number of swapping in Bubble sort is zero but the number of comparisons is higher than the Smart Bubble sort.In the case of merge sort and selection sort,both the number of comparisons and swapping are higher than those of the Smart Bubble sort.For a comprehensive understanding of better performing results and achievements of the Smart Bubble sort, I illustrated the number of comparisons, swapping, and CPU clock time for all data sizes including 500,2500,5000,50000,100000,625000,1250000,and 2500000 in Fig.3.

    Figure 3:Results for applying sorting algorithms on the sorted dataset:(a)data size 500,(b)data size 2500,(c)data size 5000,(d)data size 50000,(e)data size 1000000,(f)data size 625000,(g)data size 150000 and(h)2500000

    4.2.2 Performance Analysis of Smart Bubble Sort on Reverse Sorted Data

    The experimental results for worst-case analysis on reverse sorted data are presented in Supplementary Tab.2 where the names of the sorting algorithms are given along the top row and the data sizes are arranged along the first column.The best-performing values are highlighted in blue.It is evident from the results that in the worst-case scenario,the performance of Smart Bubble sort is much better than bubble sort and selection sort in terms of CPU clock time however, it is much slower than the merge sort algorithm.For data size 500,the CPU clock time is higher for Smart Bubble sort because the number of steps of SMART-BUBBLE-SORT(A, n) is more than those of BUBBLE-SORT(A,n).Therefore,the cost of the coefficient is higher for Smart Bubble sort as evident from Eqs.(2)and(5).However,for the data sizes greater than 500,this overhead is overtaken by the performance of the algorithm as evident from Supplementary Tab.2.The best values of CPU clock time for Smart Bubble sort are given in blue whereas the value where the CPU clock time is more for Smart Bubble sort while processing data size 500 is given in red.For a comprehensive understanding of the achieved results,I highlighted the number of comparisons,swapping,and CPU clock time for all sizes of reverse sorted data including 500,2500,5000,50000,100000,625000,1250000,and 2500000 in Fig.4.

    Figure 4: Continued

    Figure 4:Results for applying sorting algorithms on the reverse sorted dataset:(a)data size 500,(b)data size 2500,(c)data size 5000,(d)data size 50000,(e)data size 1000000,(f)data size 625000,(g)data size 150000 and(h)2500000

    4.2.3 Performance Analysis of Smart Bubble Sort on Random Data

    The experimental results for average-case analysis on random data are demonstrated in Supplementary Tab.3 where the names of the sorting algorithms are mentioned along the top row whereas the data sizes are presented along the first column.The best-performing values are highlighted in blue.The results show the superior performance of Smart Bubble sort in terms of the number of comparisons and CPU clock time over bubble sort.It can be observed from Supplementary Tab.3 that the Smart Bubble sort is performing a lesser number of comparisons than the Bubble sort as well as Selection sort for all data sizes.However,CPU clock time is lesser for data sizes 50000 and above as compared to the Bubble sort algorithm.In the case of Selection sort and Merge sort,both the number of comparisons and swapping(merging in case of merge sort)are less than those of the Smart Bubble sort.For data size 500,2500,and 5000,the CPU clock time is higher for Smart Bubble sort despite a lesser number of comparisons.This is because the number of steps of SMART-BUBBLE-SORT(A,n) is more than those of BUBBLE-SORT(A, n).Therefore, the cost of the coefficient is higher for Smart Bubble sort as evident from Eqs.(3) and (6).However, for the data sizes greater than 50000,this overhead is overtaken by the performance of the algorithm as evident from Supplementary Tab.3.The best values of comparisons and CPU clock time for Smart Bubble sort are given in blue whereas the values where the CPU clock time is more for Smart Bubble sort while processing data size of 500,2500,and 5000 are given in red.I highlighted the number of comparisons,swapping,and CPU clock time for all sizes of random data including 500, 2500, 5000, 50000, 100000, 625000, 1250000, and 2500000 in Fig.5.

    Figure 5: Results for applying sorting algorithms on the random dataset: (a) data size 500, (b) data size 2500,(c)data size 5000,(d)data size 50000,(e)data size 1000000,(f)data size 625000,(g)data size 150000 and(h)2500000

    4.2.4 Performance Analysis of Smart Bubble Sort for Validation of Dynamic Footprint

    The experimental results for dynamic footprint analysis on partially sorted data are presented in Supplementary Tab.4 where names of the sorting algorithms are mentioned along the top row and the data sizes are given along the first column.The best-performing values are highlighted in blue.The number of swapping performed by Smart Bubble sort have now become half of the total number of comparisons for a given data as claimed in the columnAverage Caseof Tab.2 and supported by the results in Supplementary Tab.4.It is because the input data is now partially sorted to establish a basis for detecting the dynamic footprint by Smart Bubble sort for transforming itself from the average case scenario to the best-case scenario.The number of comparisons performed by Smart Bubble sort is less than those of bubble sort and selection sort algorithms.I can observe that the number of swapping performed by Smart Bubble sort is equal to those of bubble sort.As I discussed previously the Smart Bubble sort can detect the dynamic footprint of the data instance and as a result, it can transform itself from an average case to the best-case scenario.The number of comparisons is less than Bubble sort is because Smart Bubble sort detected that the remaining data items are already sorted so it terminated earlier whereas bubble sort kept on comparing the already sorted elements blindly,which caused more number of comparisons.On the other hand, for data size 500, the CPU clock time is higher for Smart Bubble sort despite a lesser number of comparisons.This is because the number of steps of SMART-BUBBLE-SORT(A,n)is more than those of BUBBLE-SORT(A,n).Therefore,the cost of the coefficient is higher for the Smart Bubble sort.However,for the data sizes greater than 500,this overhead is overtaken by the performance of the algorithm as evident from Supplementary Tab.4.The best values of comparisons for Smart Bubble sort are given in blue whereas the value where the CPU clock time is more for Smart Bubble sort while processing data size 500 is given in red.It is now evident that the lesser number of comparisons by Smart Bubble sort is due to its dynamic footprint detection capability(Please,refer to Fig.6).

    Figure 6: Continued

    Figure 6:Results for applying sorting algorithms on the random dataset with 50%sorted data:(a)data size 500,(b)data size 2500,(c)data size 5000,(d)data size 50000,(e)data size 1000000,(f)data size 625000,(g)data size 150000 and(h)2500000

    5 Conclusion

    In this article, I have designed and verified a novel and dynamic variant of the bubble sort algorithm with performance improvements in the best case and average case scenarios while keeping the worst-case performance well within the upper bound.The proposed Smart Bubble sort algorithm demonstrated better performance compared to bubble sort,selection sort,and merge sort in the best case scenario with a time complexity ofΩ(n).

    To achieve the improvements for the average-case scenario,the concept of dynamic footprint has been elaborated and empirically verified.It is observed that the performance of an algorithm can be enhanced by identifying useful patterns present in the data and consequently exploiting the scenarios for improving the performance and efficiency of the algorithm.Smart Bubble sort can detect the useful patterns in average case data favoring its transformation to the best-case scenario and finally,it can adapt from average case to the best-case scenario.This enables it to terminate early in the sorting process while giving about a 25%performance raise over bubble sort.

    Data Availability Statement:The constructed datasets are available at https://drive.google.com/file/d/112pWWW_cDWgM7O3oa80Tn6O1ASR38mEh/view?usp=sharing.

    Funding Statement:The author received no specific funding for this study.

    Conflicts of Interest:The author declares that he has no conflicts of interest to report regarding the present study.

    亚洲精品色激情综合| 久久这里只有精品19| 国产亚洲精品久久久久久毛片| 丝袜人妻中文字幕| 国产黄a三级三级三级人| 麻豆成人av在线观看| 成人无遮挡网站| 国产一区在线观看成人免费| 久久精品91蜜桃| 伦理电影免费视频| 日本 欧美在线| 国产欧美日韩精品亚洲av| 一进一出抽搐gif免费好疼| 国产精品一区二区免费欧美| 又大又爽又粗| 十八禁网站免费在线| 小说图片视频综合网站| 国产精品 国内视频| 欧美性猛交黑人性爽| 美女午夜性视频免费| 亚洲成人免费电影在线观看| 国产激情偷乱视频一区二区| 精品久久久久久成人av| 99久国产av精品| 亚洲精品色激情综合| 日韩中文字幕欧美一区二区| 母亲3免费完整高清在线观看| 在线免费观看的www视频| 国产爱豆传媒在线观看| 九九在线视频观看精品| 成人国产综合亚洲| 国产激情久久老熟女| bbb黄色大片| 国产亚洲欧美在线一区二区| 久久国产乱子伦精品免费另类| 亚洲欧美日韩高清在线视频| 国产97色在线日韩免费| 高清毛片免费观看视频网站| 91在线精品国自产拍蜜月 | 成人无遮挡网站| 波多野结衣高清作品| 搡老岳熟女国产| 特级一级黄色大片| 久久人妻av系列| 99久久成人亚洲精品观看| 一级作爱视频免费观看| 亚洲国产欧美人成| 欧美在线黄色| 成人av一区二区三区在线看| 国产亚洲精品久久久久久毛片| 美女被艹到高潮喷水动态| x7x7x7水蜜桃| 国产淫片久久久久久久久 | 国产精品久久久人人做人人爽| 精品电影一区二区在线| 久久精品91蜜桃| 一级毛片女人18水好多| 成年免费大片在线观看| 俺也久久电影网| 91久久精品国产一区二区成人 | 成年女人看的毛片在线观看| 9191精品国产免费久久| 国产av麻豆久久久久久久| 国产美女午夜福利| 真人一进一出gif抽搐免费| 午夜精品在线福利| 在线观看美女被高潮喷水网站 | 国产成年人精品一区二区| 在线视频色国产色| 又粗又爽又猛毛片免费看| 日韩欧美 国产精品| 首页视频小说图片口味搜索| 久久精品影院6| 9191精品国产免费久久| 国产成人精品久久二区二区91| 亚洲av成人不卡在线观看播放网| 精品电影一区二区在线| 亚洲精品在线观看二区| 三级国产精品欧美在线观看 | 日韩欧美精品v在线| 激情在线观看视频在线高清| 欧美中文日本在线观看视频| 日日干狠狠操夜夜爽| 色噜噜av男人的天堂激情| 欧美+亚洲+日韩+国产| 日韩免费av在线播放| 久久久久久人人人人人| 日日夜夜操网爽| 国产精品久久电影中文字幕| 三级毛片av免费| 亚洲五月婷婷丁香| 我要搜黄色片| 天天添夜夜摸| 香蕉丝袜av| 国产又色又爽无遮挡免费看| 国产午夜福利久久久久久| 国产1区2区3区精品| 成人精品一区二区免费| 小蜜桃在线观看免费完整版高清| 国产久久久一区二区三区| 99热这里只有精品一区 | 99久久成人亚洲精品观看| 久久伊人香网站| 午夜免费激情av| 人人妻人人看人人澡| 亚洲七黄色美女视频| 亚洲成人中文字幕在线播放| 国产精品综合久久久久久久免费| 国产精品亚洲一级av第二区| 激情在线观看视频在线高清| 成人高潮视频无遮挡免费网站| 9191精品国产免费久久| 中文字幕高清在线视频| 中文字幕高清在线视频| 国产av麻豆久久久久久久| 国产亚洲精品综合一区在线观看| 亚洲无线观看免费| 亚洲色图av天堂| 亚洲成av人片在线播放无| 国产探花在线观看一区二区| 一级毛片女人18水好多| 特大巨黑吊av在线直播| 精品99又大又爽又粗少妇毛片 | 很黄的视频免费| 久久久国产精品麻豆| 国产精品久久久av美女十八| 久久久久久九九精品二区国产| 久久久久亚洲av毛片大全| 国产一区二区在线观看日韩 | 99热这里只有精品一区 | 高潮久久久久久久久久久不卡| 国产又黄又爽又无遮挡在线| 国内久久婷婷六月综合欲色啪| 精品久久久久久成人av| 国产单亲对白刺激| 校园春色视频在线观看| 国产精品电影一区二区三区| 色老头精品视频在线观看| 精品国内亚洲2022精品成人| svipshipincom国产片| 桃色一区二区三区在线观看| 在线观看日韩欧美| 青草久久国产| 国产亚洲精品久久久com| 午夜福利在线观看吧| 国产精品 国内视频| 免费搜索国产男女视频| 亚洲国产精品成人综合色| 香蕉丝袜av| 日本免费a在线| 免费大片18禁| 亚洲aⅴ乱码一区二区在线播放| 亚洲av熟女| 亚洲狠狠婷婷综合久久图片| 成在线人永久免费视频| 18美女黄网站色大片免费观看| 国产高清激情床上av| 午夜影院日韩av| 97碰自拍视频| 五月伊人婷婷丁香| 午夜免费观看网址| 亚洲av第一区精品v没综合| 色吧在线观看| 婷婷六月久久综合丁香| 男人舔女人下体高潮全视频| 成人三级黄色视频| 国产私拍福利视频在线观看| 天天添夜夜摸| 精品久久久久久久末码| 日韩有码中文字幕| 国产精品久久久久久人妻精品电影| 国产一区二区在线av高清观看| 九九热线精品视视频播放| 国产黄色小视频在线观看| 别揉我奶头~嗯~啊~动态视频| 后天国语完整版免费观看| 亚洲五月天丁香| 久久久久国内视频| 桃红色精品国产亚洲av| 香蕉国产在线看| 三级毛片av免费| 免费看日本二区| 日本在线视频免费播放| 久久热在线av| 在线播放国产精品三级| 亚洲在线观看片| 搞女人的毛片| 成年女人看的毛片在线观看| 国产亚洲av高清不卡| 欧美+亚洲+日韩+国产| 国产一区在线观看成人免费| 国产蜜桃级精品一区二区三区| 五月玫瑰六月丁香| 久久中文字幕一级| 最近在线观看免费完整版| 热99re8久久精品国产| 俺也久久电影网| 欧美性猛交╳xxx乱大交人| 五月玫瑰六月丁香| 亚洲色图av天堂| 激情在线观看视频在线高清| 熟妇人妻久久中文字幕3abv| 欧美激情久久久久久爽电影| 免费在线观看影片大全网站| 老熟妇仑乱视频hdxx| 欧美一区二区精品小视频在线| 午夜福利18| 日韩 欧美 亚洲 中文字幕| 久久久久久久久久黄片| 19禁男女啪啪无遮挡网站| 亚洲国产欧美一区二区综合| 黄色片一级片一级黄色片| 女警被强在线播放| 国产成人av教育| 操出白浆在线播放| 色视频www国产| 人妻久久中文字幕网| 国产aⅴ精品一区二区三区波| 中文字幕久久专区| 国产熟女xx| 变态另类成人亚洲欧美熟女| 12—13女人毛片做爰片一| 午夜福利18| 国产主播在线观看一区二区| 美女黄网站色视频| 国产精品九九99| 性色avwww在线观看| 中出人妻视频一区二区| 桃色一区二区三区在线观看| 久久久久国产一级毛片高清牌| 亚洲男人的天堂狠狠| 日韩欧美在线乱码| 国产精品久久久久久久电影 | av女优亚洲男人天堂 | 国产午夜福利久久久久久| 99re在线观看精品视频| 国产精品爽爽va在线观看网站| 国产一区二区三区在线臀色熟女| 97碰自拍视频| 国内揄拍国产精品人妻在线| 成人特级av手机在线观看| 夜夜爽天天搞| 久久亚洲真实| 高清毛片免费观看视频网站| 国内精品久久久久久久电影| 级片在线观看| 欧美乱码精品一区二区三区| 久久国产精品影院| 神马国产精品三级电影在线观看| 丰满的人妻完整版| 亚洲国产欧美人成| 亚洲av日韩精品久久久久久密| a级毛片在线看网站| 99久久综合精品五月天人人| 99国产精品99久久久久| 国产视频一区二区在线看| 999久久久国产精品视频| 亚洲自拍偷在线| 波多野结衣高清作品| 黄频高清免费视频| 成人性生交大片免费视频hd| 国产综合懂色| 麻豆成人av在线观看| 国产一区二区在线观看日韩 | 丰满人妻熟妇乱又伦精品不卡| 国产视频内射| 婷婷丁香在线五月| 国产精品永久免费网站| 国产伦在线观看视频一区| 久久久久久九九精品二区国产| 久久国产乱子伦精品免费另类| 国产精品日韩av在线免费观看| 99riav亚洲国产免费| www.熟女人妻精品国产| 超碰成人久久| 国产av在哪里看| 琪琪午夜伦伦电影理论片6080| 一级作爱视频免费观看| 亚洲国产精品久久男人天堂| 又黄又粗又硬又大视频| 一区二区三区激情视频| 在线视频色国产色| 丰满人妻一区二区三区视频av | 精品人妻1区二区| 久久久水蜜桃国产精品网| 1024香蕉在线观看| 波多野结衣高清作品| 亚洲av美国av| 国产精品av久久久久免费| 免费观看的影片在线观看| 老鸭窝网址在线观看| 日本一二三区视频观看| 一个人观看的视频www高清免费观看 | 亚洲熟女毛片儿| 亚洲乱码一区二区免费版| 黄色 视频免费看| 久久久久亚洲av毛片大全| 男女床上黄色一级片免费看| 免费观看的影片在线观看| 亚洲avbb在线观看| 人人妻人人看人人澡| 国产极品精品免费视频能看的| 国产又色又爽无遮挡免费看| 亚洲精品国产精品久久久不卡| 亚洲18禁久久av| 男人的好看免费观看在线视频| 日本在线视频免费播放| 亚洲午夜精品一区,二区,三区| 午夜视频精品福利| 在线免费观看的www视频| 免费观看的影片在线观看| 国产又黄又爽又无遮挡在线| 亚洲色图av天堂| 麻豆久久精品国产亚洲av| 国产精品久久久av美女十八| or卡值多少钱| 亚洲人与动物交配视频| 日韩大尺度精品在线看网址| 搞女人的毛片| 神马国产精品三级电影在线观看| АⅤ资源中文在线天堂| 高清毛片免费观看视频网站| 一卡2卡三卡四卡精品乱码亚洲| 搡老熟女国产l中国老女人| 大型黄色视频在线免费观看| 中文字幕人妻丝袜一区二区| 性色avwww在线观看| 校园春色视频在线观看| 欧美日韩国产亚洲二区| av在线蜜桃| 亚洲精品一区av在线观看| 少妇裸体淫交视频免费看高清| 久久久国产成人精品二区| 国产午夜精品论理片| 日韩人妻高清精品专区| 国产精品一及| 麻豆av在线久日| 蜜桃久久精品国产亚洲av| 白带黄色成豆腐渣| 人人妻,人人澡人人爽秒播| 亚洲性夜色夜夜综合| 女警被强在线播放| 久久精品国产综合久久久| 人人妻,人人澡人人爽秒播| 中文字幕人成人乱码亚洲影| 久久国产乱子伦精品免费另类| 成人特级av手机在线观看| 1024手机看黄色片| 窝窝影院91人妻| 国产乱人视频| 叶爱在线成人免费视频播放| 日本黄色片子视频| 日日摸夜夜添夜夜添小说| 精品电影一区二区在线| 99国产综合亚洲精品| 日本撒尿小便嘘嘘汇集6| 国产伦精品一区二区三区四那| 精品国产超薄肉色丝袜足j| 国产精品一及| 我要搜黄色片| 婷婷丁香在线五月| 国产亚洲av高清不卡| 天堂动漫精品| x7x7x7水蜜桃| 两性午夜刺激爽爽歪歪视频在线观看| 小说图片视频综合网站| 搡老岳熟女国产| 在线观看美女被高潮喷水网站 | 亚洲性夜色夜夜综合| 国产美女午夜福利| 中文字幕久久专区| 1000部很黄的大片| 国产蜜桃级精品一区二区三区| 91字幕亚洲| a级毛片a级免费在线| 一本一本综合久久| 国产成人av激情在线播放| 国产一级毛片七仙女欲春2| 美女高潮喷水抽搐中文字幕| 性色avwww在线观看| 国产69精品久久久久777片 | 最新美女视频免费是黄的| 精品欧美国产一区二区三| 99久久成人亚洲精品观看| 亚洲精品在线美女| 舔av片在线| 久9热在线精品视频| 一级毛片精品| 一区二区三区激情视频| 热99在线观看视频| 青草久久国产| 日韩欧美在线乱码| 热99在线观看视频| 欧美日韩一级在线毛片| 国产精品亚洲美女久久久| 国产精品久久久久久亚洲av鲁大| 中文字幕人妻丝袜一区二区| 亚洲av成人av| 给我免费播放毛片高清在线观看| 亚洲欧美日韩高清在线视频| 男人舔奶头视频| 在线观看美女被高潮喷水网站 | 成年免费大片在线观看| 亚洲自偷自拍图片 自拍| 1024香蕉在线观看| 午夜激情欧美在线| 国产亚洲精品一区二区www| 精品人妻1区二区| 国产精品九九99| 中文字幕精品亚洲无线码一区| 欧美日本视频| 在线视频色国产色| 欧美黑人巨大hd| 精品久久久久久久久久久久久| 狠狠狠狠99中文字幕| 非洲黑人性xxxx精品又粗又长| 欧美乱色亚洲激情| 九九久久精品国产亚洲av麻豆 | 久久久久国内视频| 久久久久精品国产欧美久久久| 欧美三级亚洲精品| 日韩人妻高清精品专区| 国产男靠女视频免费网站| 免费看美女性在线毛片视频| 亚洲国产精品久久男人天堂| 亚洲中文字幕一区二区三区有码在线看 | 国产成人系列免费观看| 亚洲av美国av| 在线观看免费午夜福利视频| 波多野结衣巨乳人妻| 国产精品av视频在线免费观看| 国产精品美女特级片免费视频播放器 | 黄色成人免费大全| 久久婷婷人人爽人人干人人爱| av视频在线观看入口| 精品一区二区三区av网在线观看| 好男人电影高清在线观看| 男女之事视频高清在线观看| 国产精品永久免费网站| 日韩免费av在线播放| 偷拍熟女少妇极品色| 国产v大片淫在线免费观看| 亚洲人成网站在线播放欧美日韩| 欧美一区二区国产精品久久精品| 成人亚洲精品av一区二区| 亚洲精品在线美女| 国产精品精品国产色婷婷| 午夜激情福利司机影院| 五月玫瑰六月丁香| 亚洲国产精品成人综合色| 观看免费一级毛片| 亚洲成人中文字幕在线播放| tocl精华| 天天一区二区日本电影三级| 亚洲精品美女久久av网站| 欧美黄色淫秽网站| 夜夜看夜夜爽夜夜摸| 嫩草影院精品99| 99热这里只有是精品50| av中文乱码字幕在线| 老鸭窝网址在线观看| 国内精品久久久久精免费| 日韩欧美精品v在线| 国产精品久久久久久人妻精品电影| 欧美一级a爱片免费观看看| 国产成人系列免费观看| 桃红色精品国产亚洲av| 日韩欧美在线乱码| 男女做爰动态图高潮gif福利片| 精品久久久久久久末码| 九色国产91popny在线| 日韩成人在线观看一区二区三区| 丝袜人妻中文字幕| 久久久久久久久中文| 亚洲国产看品久久| 成人无遮挡网站| 亚洲在线自拍视频| 国产极品精品免费视频能看的| 一个人免费在线观看的高清视频| 99久久成人亚洲精品观看| 波多野结衣高清无吗| 18禁裸乳无遮挡免费网站照片| 99久久精品一区二区三区| 日韩欧美精品v在线| 丝袜人妻中文字幕| 久久久久免费精品人妻一区二区| 长腿黑丝高跟| 久久午夜综合久久蜜桃| 两性午夜刺激爽爽歪歪视频在线观看| 九九久久精品国产亚洲av麻豆 | 成年人黄色毛片网站| 久久久久久久久中文| 国产蜜桃级精品一区二区三区| 99久久国产精品久久久| 黄色成人免费大全| 香蕉av资源在线| 又爽又黄无遮挡网站| 国产亚洲av高清不卡| 天天添夜夜摸| 免费看日本二区| 日本黄大片高清| 国产精品 国内视频| 好看av亚洲va欧美ⅴa在| 九色成人免费人妻av| 成年女人毛片免费观看观看9| 国产高清视频在线播放一区| 中文字幕熟女人妻在线| 伦理电影免费视频| 91av网一区二区| 欧美成狂野欧美在线观看| 久久精品国产综合久久久| 巨乳人妻的诱惑在线观看| 国产精品美女特级片免费视频播放器 | 99国产精品一区二区三区| 久久久久久久午夜电影| 99久久成人亚洲精品观看| 成人国产一区最新在线观看| 嫩草影院入口| 中文字幕久久专区| avwww免费| 国产真实乱freesex| 日本熟妇午夜| 琪琪午夜伦伦电影理论片6080| 午夜久久久久精精品| 五月伊人婷婷丁香| 97超级碰碰碰精品色视频在线观看| 999久久久精品免费观看国产| 成人特级av手机在线观看| 黄色丝袜av网址大全| 亚洲欧美精品综合一区二区三区| 国产黄a三级三级三级人| 婷婷丁香在线五月| 日本黄大片高清| 在线观看午夜福利视频| 欧美绝顶高潮抽搐喷水| 亚洲精品美女久久久久99蜜臀| 三级毛片av免费| 日韩中文字幕欧美一区二区| 亚洲欧美日韩卡通动漫| 国产激情偷乱视频一区二区| 欧美黄色片欧美黄色片| 国产成年人精品一区二区| 在线免费观看不下载黄p国产 | 免费高清视频大片| 国产久久久一区二区三区| 国产精品影院久久| 黄片大片在线免费观看| 国产精品乱码一区二三区的特点| 日韩欧美三级三区| 国产v大片淫在线免费观看| 男人舔女人的私密视频| 嫁个100分男人电影在线观看| 亚洲最大成人中文| 综合色av麻豆| 真实男女啪啪啪动态图| 村上凉子中文字幕在线| 亚洲国产色片| 夜夜看夜夜爽夜夜摸| 成人午夜高清在线视频| 亚洲av片天天在线观看| 精品国产美女av久久久久小说| 精品久久蜜臀av无| 欧美+亚洲+日韩+国产| 美女cb高潮喷水在线观看 | 丰满的人妻完整版| 国产成人一区二区三区免费视频网站| 国产视频一区二区在线看| 岛国在线免费视频观看| 欧美高清成人免费视频www| 国产一区二区激情短视频| 精品国内亚洲2022精品成人| 日本精品一区二区三区蜜桃| 成人18禁在线播放| 久久精品aⅴ一区二区三区四区| 成年女人毛片免费观看观看9| 日韩欧美精品v在线| 老司机午夜十八禁免费视频| 国产乱人视频| 非洲黑人性xxxx精品又粗又长| www.自偷自拍.com| 三级毛片av免费| 午夜免费成人在线视频| 国产麻豆成人av免费视频| 此物有八面人人有两片| 99久久国产精品久久久| 欧美又色又爽又黄视频| 黄色片一级片一级黄色片| 神马国产精品三级电影在线观看| 99热6这里只有精品| 国产男靠女视频免费网站| 国产69精品久久久久777片 | 亚洲精品久久国产高清桃花| 网址你懂的国产日韩在线| 欧美成人性av电影在线观看| 无限看片的www在线观看| 亚洲九九香蕉| 超碰成人久久| 欧美zozozo另类| 婷婷精品国产亚洲av| 久久精品91无色码中文字幕| 亚洲熟女毛片儿| 18禁裸乳无遮挡免费网站照片| 熟女电影av网| 国产亚洲精品久久久com| 1000部很黄的大片| 午夜精品久久久久久毛片777| 日韩免费av在线播放| 亚洲成人久久爱视频| av在线蜜桃| 中文字幕精品亚洲无线码一区| 波多野结衣高清无吗| 女人被狂操c到高潮| 午夜影院日韩av| 亚洲av电影不卡..在线观看| 日韩 欧美 亚洲 中文字幕|