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 vote129 views1 answer
Print pattern and space in cpp
C++
0 vote138 views1 answer
CoinPiles
C++
1 vote173 views1 answer
Can you verify adsense no ssl certificate
C++
0 vote131 views3 answers
If
C++
2 votes144 views1 answer
Cannot find "-lsqlite3" C++
C++
0 vote152 views1 answer
Surf interpolation matlab
C++
27 votes140 views6 answers
Bootstrap grid
C++
0 vote137 views1 answer
Is vscode better than sublime
C++
0 vote141 views1 answer
Hamming c++
C++
1 vote178 views1 answer
Eosio name to string
C++