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 vote138 views2 answers
#define in cpp
C++
1 vote134 views1 answer
C++ check open processes
C++
0 vote136 views1 answer
Operators on strings c++
C++
1 vote131 views1 answer
How to get mouse position on window sfm;
C++
0 vote244 views1 answer
Dynamically allocate a string object and save the address in the pointer variable p.
C++
0 vote141 views1 answer
Converting a string to lowercase inbuld function in cpp
C++
0 vote139 views1 answer
Get player pawn
C++
0 vote134 views2 answers
C++ code
C++
15 votes203 views6 answers
Factorial
C++
7 votes142 views5 answers
Sleep c++
C++