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

23 votes357 views2 answers
User input c++
C++
1 vote302 views1 answer
How to fix class friendship errors in c++
C++
0 vote297 views1 answer
C++ get index of map element
C++
8 votes392 views10 answers
Javascript loop array
C++
0 vote285 views1 answer
Convert kelvin to Fahrenheit
C++
5 votes343 views2 answers
Delete specific row from dynamic 2d array c++
C++
-1 vote332 views1 answer
Fast way to check if a number is prime C++
C++
0 vote314 views2 answers
Sort using comparator anonymous function c++
C++
0 vote304 views1 answer
How the theam are store in database
C++
0 vote313 views1 answer
To toggle (flip the status of) the k-th item of the set
C++