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 vote177 views1 answer
What is push() c++
C++
0 vote191 views1 answer
Surf interpolation matlab
C++
0 vote177 views1 answer
Function return floatin c++
C++
0 vote184 views1 answer
String to hexadecimal in c
C++
18 votes196 views3 answers
How to make a 2d vector in c++
C++
1 vote162 views1 answer
C++ check if string contains non alphanumeric
C++
0 vote189 views1 answer
Closing a ifstream file c++
C++
0 vote185 views1 answer
C++ iterate over vector of pointers
C++
0 vote215 views1 answer
How to format big numbers with commas in c++
C++
0 vote178 views1 answer
2000pp pp play osu std
C++