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 vote180 views1 answer
(1 & 1) in cpp
C++
0 vote232 views1 answer
How to analyse a poem
C++
0 vote197 views1 answer
Print octal number in c++
C++
4 votes247 views2 answers
Max_element c++
C++
-2 votes184 views6 answers
Array in c++
C++
3 votes178 views2 answers
A+b+c whole square
C++
1 vote221 views1 answer
Qt design editor hide window bottom white bar
C++
0 vote195 views1 answer
C++ linker input and output
C++
0 vote213 views1 answer
C++ check if vector is sorted
C++
0 vote179 views1 answer
Google test assert stdout
C++