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 vote97 views2 answers
Greatest and smallest in 3 numbers cpp
C++
0 vote97 views1 answer
What is the system function in c++
C++
0 vote98 views1 answer
Sento freddo a un dente
C++
14 votes104 views1 answer
C++ optimization dynamic 2d array
C++
0 vote102 views1 answer
Simple program for sign in and sign up in c++
C++
60 votes139 views2 answers
For(var i=0; i<=10; i++)
C++
0 vote94 views1 answer
Get index by pointer to element of vector c++
C++
0 vote98 views1 answer
Cout wchar_t
C++
2 votes99 views1 answer
How to make a comment in c++
C++
0 vote117 views1 answer
Remove item from layout
C++