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 vote286 views1 answer
C++ program transpose of matrix
C++
0 vote287 views1 answer
Get thread id c++
C++
4 votes312 views1 answer
Continue c++
C++
0 vote272 views1 answer
QT form doesn't take changes
C++
2 votes268 views1 answer
C++ print current time
C++
0 vote269 views1 answer
Cout alternative c++
C++
23 votes308 views2 answers
User input c++
C++
0 vote295 views1 answer
What is stdarg.h used for
C++
0 vote302 views1 answer
Three way comparison operator c++
C++
0 vote291 views1 answer
Cpp get keystroke in console only
C++