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

1 vote174 views1 answer
Naive pattern matching algorithm
C++
0 vote212 views2 answers
Total sales in array c++ two dimensional array
C++
0 vote157 views7 answers
C++ convert to assembly language
C++
2 votes158 views2 answers
Cpp split string by space
C++
0 vote161 views1 answer
Namespace c++
C++
0 vote158 views1 answer
C++ clip values
C++
0 vote160 views1 answer
C++ program to find gcd of 3 numbers
C++
0 vote167 views1 answer
Input full line as input in cpp
C++
0 vote244 views1 answer
Operator overloading outside class
C++
2 votes161 views2 answers
Print stack c++
C++