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

0 vote206 views1 answer
Std distance
C++
38 votes218 views6 answers
How to print hello world in c++
C++
7 votes177 views3 answers
C++ auto loop
C++
0 vote158 views1 answer
Remove the jth object from the subset
C++
2 votes161 views6 answers
Loop in c++
C++
7 votes170 views1 answer
Appending a vector to a vector in C++
C++
5 votes173 views1 answer
Initialize vector to all zeros c++
C++
4 votes170 views3 answers
C++ how to get maximum value
C++
2 votes187 views1 answer
C++ virtual function in constructor
C++
0 vote170 views1 answer
Javidx9 age
C++