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 vote171 views1 answer
C++ loop trhought object
C++
3 votes146 views1 answer
Rick astley - never gonna give you up
C++
0 vote108 views1 answer
Identity
C++
0 vote231 views1 answer
Built in led
C++
0 vote163 views1 answer
Sort html elements in Jquery on condition
C++
2 votes130 views3 answers
Vector with initial size
C++
0 vote153 views1 answer
C++ get pointer from unique_ptr
C++
0 vote185 views1 answer
Passing custom function in sort cpp
C++
5 votes144 views2 answers
Undefined reference to `pthread_create' c++
C++
4 votes156 views3 answers
GCD in cpp
C++