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 vote106 views1 answer
Temparory Email Id
C++
19 votes153 views4 answers
How to get size of 2d vector in c++
C++
1 vote111 views1 answer
Creator of C++
C++
0 vote106 views1 answer
Lambda function qt connect
C++
-1 vote106 views1 answer
Int to hexadecimal in c++
C++
0 vote102 views1 answer
How to generate number in c++
C++
0 vote103 views1 answer
Turbo c++ easy programs
C++
4 votes104 views1 answer
C++ get nth character in string
C++
0 vote104 views7 answers
Online converter c++ to c
C++
1 vote106 views1 answer
Uri online judge 3145 solution in c++
C++