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

75 votes145 views6 answers
Conda list envs
C++
8 votes96 views5 answers
C++ vector resize
C++
0 vote95 views1 answer
C++ set count
C++
0 vote112 views1 answer
Smooth Poti values on Arduino
C++
0 vote101 views1 answer
Sort 2d vector c++
C++
0 vote179 views1 answer
Vector init c++
C++
30 votes100 views5 answers
Remove value from vector c++
C++
0 vote103 views1 answer
Char at in c++
C++
7 votes104 views3 answers
C++ get data type
C++
1 vote110 views1 answer
Restting a queue stl
C++