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

3 votes146 views1 answer
Set precision with fixed c++
C++
2 votes139 views1 answer
Get type of an object c++
C++
0 vote174 views1 answer
Import matrix from excel to matlab
C++
0 vote151 views1 answer
Shuffle elements c++
C++
4 votes165 views3 answers
Converting char to int in c++
C++
19 votes169 views1 answer
How to output to a file in c++
C++
0 vote155 views1 answer
Print queue c++
C++
1 vote158 views1 answer
Marksheet make in the c++
C++
1 vote182 views1 answer
Prime number generator c++
C++
1 vote145 views1 answer
C++ logger class example
C++