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 vote243 views1 answer
Check if a variable is tring c++
C++
0 vote244 views1 answer
Elements of set c++
C++
1 vote262 views1 answer
Std::queue
C++
-1 vote246 views1 answer
Cast c++
C++
26 votes248 views10 answers
Snake
C++
3 votes214 views1 answer
Loop over multidimensional array c++
C++
0 vote229 views2 answers
Cplusplusbtutotrail
C++
0 vote252 views1 answer
Ue4 set size of widget c++
C++
0 vote259 views1 answer
Powershell script query mssql windows authentication
C++
0 vote271 views1 answer
Lambda function qt connect
C++