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

-1 vote111 views1 answer
Sinonimo de tratar
C++
9 votes103 views3 answers
How to iterate in string in c++
C++
0 vote118 views1 answer
Temporary file using MSFT API in cpp
C++
0 vote106 views1 answer
Kadane algorithm with negative numbers included as sum
C++
0 vote115 views1 answer
How to declare a vector of int in c++
C++
0 vote117 views1 answer
C++ write to file in directory
C++
-1 vote103 views1 answer
Longest increasing subsequence nlogn c++
C++
1 vote100 views1 answer
C++ std string to float
C++
3 votes121 views2 answers
Print type c++
C++
1 vote133 views1 answer
How to delete an element in vector pair in cpp
C++