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 vote235 views1 answer
Programs using vectors in c++
C++
0 vote218 views1 answer
What is imposter syndrome
C++
0 vote245 views1 answer
Heroatx77
C++
1 vote240 views1 answer
Priority queue ordered by second element
C++
4 votes204 views1 answer
Cin statement c++
C++
0 vote240 views1 answer
Print elements of linked list
C++
1 vote257 views1 answer
Master header file c++
C++
0 vote213 views1 answer
CoinPiles
C++
0 vote224 views1 answer
How to change colour image to grey in opencv c++
C++
0 vote221 views1 answer
C++ foreach vector
C++