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 vote277 views10 answers
Convert java code to c++ online
C++
0 vote336 views1 answer
What is a ~ in c++
C++
0 vote322 views1 answer
Unordered_map header file c++
C++
1 vote296 views1 answer
Crtdbg c++
C++
0 vote304 views1 answer
My cpp
C++
0 vote324 views1 answer
How to extract a bit from a byte in c++
C++
1 vote285 views1 answer
Declare nullptr c++
C++
3 votes292 views1 answer
Function in struct c++
C++
0 vote272 views1 answer
C++ while loop decrement
C++
0 vote316 views1 answer
C++ iterate over vector of pointers
C++