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

1 vote181 views1 answer
What is c++ standard library
C++
6 votes152 views1 answer
Rng cpp
C++
1 vote190 views1 answer
Rapidjson write stringbuffer to file
C++
0 vote198 views1 answer
Temparory Email Id
C++
15 votes186 views4 answers
How to make a random number in c++
C++
0 vote183 views1 answer
Double array size c++
C++
0 vote213 views2 answers
C++ compile to msi
C++
2 votes182 views3 answers
Cpp online compiler
C++
0 vote180 views1 answer
Lap trinh file explorer c++
C++
0 vote191 views1 answer
Macro c++
C++