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 vote292 views1 answer
C++ over load oprator to print variable of clas
C++
5 votes297 views1 answer
Qt debug
C++
2 votes316 views2 answers
Array and for loop in c++
C++
0 vote321 views1 answer
Is palindrom
C++
0 vote282 views1 answer
Check if char are equal c++
C++
0 vote273 views1 answer
Uint16_t in c++
C++
92 votes492 views4 answers
Change integer to string c++
C++
-1 vote324 views1 answer
Ob for nginx.service failed because the control process exited with error code. See "systemctl status nginx.service" and "journalctl -xe" for details.
C++
14 votes299 views5 answers
Length of array c++
C++
0 vote277 views1 answer
Create new node in tree
C++