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

4 votes196 views1 answer
Gcd of two numbers c++
C++
0 vote185 views1 answer
What is thread in c++
C++
0 vote191 views1 answer
Backward chaining python
C++
28 votes158 views0 answer
C c++
C++
0 vote223 views1 answer
Operand-- c++
C++
0 vote185 views1 answer
Flutter websocket auto reconnect
C++
1 vote170 views1 answer
C++ initialize static variable
C++
1 vote184 views3 answers
C++ concatenate strings
C++
18 votes187 views4 answers
Array length c++
C++
34 votes177 views6 answers
C++ string to int
C++