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 vote338 views1 answer
Temperature conversion in c++
C++
37 votes428 views2 answers
Remove element by index from vector c++
C++
1 vote353 views1 answer
Swap using Function template in c++
C++
0 vote346 views1 answer
C++ convert int to double
C++
0 vote374 views2 answers
Default order in set in c++
C++
0 vote347 views1 answer
Why exceptions can lead to memory leaks
C++
0 vote363 views1 answer
C++ typedef template class
C++
0 vote353 views2 answers
C++ namespace example
C++
0 vote396 views1 answer
Left margin c++
C++
10 votes375 views3 answers
Remove duplicates from vector c++
C++