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 vote315 views5 answers
Palindrome String
C++
0 vote277 views2 answers
What are manipulators in c++
C++
28 votes221 views0 answer
C c++
C++
1 vote281 views3 answers
C++ concatenate strings
C++
0 vote325 views1 answer
Vector init c++
C++
1 vote332 views1 answer
How to iterate throguh a string in c++
C++
1 vote273 views3 answers
Cout in c++
C++
1 vote336 views1 answer
Qt qstring to double
C++
30 votes252 views10 answers
Google translate
C++
0 vote251 views1 answer
How to play sounds in c++
C++