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 vote294 views1 answer
Write C++ program that will ask to choose from three cases.
C++
0 vote314 views1 answer
Who made c++
C++
19 votes301 views1 answer
File objects in c++
C++
0 vote312 views1 answer
Find N Unique Integers Sum Up to Zero
C++
2 votes332 views2 answers
Anagram
C++
19 votes329 views5 answers
When kotlin
C++
0 vote327 views4 answers
How to modify 2d array in function c++
C++
0 vote588 views1 answer
Opengl draw house using glut c++
C++
0 vote314 views1 answer
Print all even number using for loop c++
C++
4 votes333 views1 answer
C++ vector pop_back
C++