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

4 votes173 views1 answer
Clear file before writing c++
C++
23 votes272 views10 answers
Pycharm
C++
1 vote203 views1 answer
How to hide the c++ console
C++
0 vote221 views1 answer
Comment installer boost c++ sur windows
C++
0 vote168 views1 answer
Uint16_t in c++
C++
0 vote189 views2 answers
How to create array with not constant size in cpp
C++
3 votes174 views1 answer
Convert refference to pointer c++
C++
0 vote189 views1 answer
Recursive factorial of a number
C++
0 vote197 views1 answer
Runtime error(Exit status:153(File size limit exceeded)) c++
C++
0 vote192 views1 answer
Transform c++
C++