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

5 votes347 views1 answer
Qt debug
C++
0 vote286 views1 answer
Gtest assert not equal
C++
0 vote330 views1 answer
C++ program to convert kelvin to celsius
C++
0 vote368 views1 answer
Sort strings by length and by alphabet
C++
0 vote329 views1 answer
C++ multiple if conditions
C++
16 votes376 views1 answer
If vector contains value c++
C++
1 vote355 views1 answer
How to return char* from function in c++
C++
12 votes371 views3 answers
C++ max of array
C++
10 votes333 views3 answers
C++ int to char*
C++
3 votes372 views2 answers
Opencv(4.1.2) /io/opencv/modules/imgproc/src/resize.cpp:3720: error: (-215:assertion failed) !ssize.empty() in function 'resize'
C++