Optimized Bubble Sort

void bubbleSort(int *arr, int n)
{
    for(int i=0; i<n; i++)
    {
      bool flag = false;
       for(int j=0; j<n-i-1; j++)
       {
          if(array[j]>array[j+1])
          {
            flag = true;
             int temp = array[j+1];
             array[j+1] = array[j];
             array[j] = temp;
          }
       }
      // No Swapping happened, array is sorted
      if(!flag){
         return;
      }
   }
}

Source: ritambhara.in

Similar codes

1 vote165 views1 answer
Chrono library c++
C++
0 vote160 views1 answer
How to install boost c++ on windows
C++
0 vote187 views1 answer
Qt file explorer
C++
3 votes269 views3 answers
Class cpp
C++
0 vote157 views1 answer
Matplotlib hide numbers on axis
C++
0 vote177 views1 answer
Polycarp found a rectangular table consisting of n rows and m columns. He noticed that each cell of the table has its number, obtained by the following algorithm "by columns": codeforces solution
C++
1 vote157 views1 answer
How to do sets in cpp
C++
0 vote172 views1 answer
Bit c++
C++
0 vote165 views1 answer
Dynamically allocate a string object and save the address in the pointer variable p.
C++
-1 vote158 views1 answer
C++ forloop
C++