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 vote137 views1 answer
Sum of first 100 natural numbers
C++
0 vote124 views1 answer
C++ conditional typedef
C++
0 vote140 views1 answer
Finding no of unique characters in a string c++
C++
0 vote153 views1 answer
Equals operator c++ overlaod
C++
0 vote129 views1 answer
Bitwise operator in C++ example programs
C++
1 vote128 views1 answer
Vector search by element
C++
0 vote127 views1 answer
Convert string to wide string
C++
1 vote126 views1 answer
Qimage transformed
C++
4 votes147 views2 answers
Max_element c++
C++
0 vote123 views1 answer
How to read qlistwidget in c++
C++