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 vote279 views1 answer
One dimensiol array to two dimen c++
C++
0 vote296 views1 answer
Assignment of single field in struct in solidity
C++
0 vote282 views1 answer
C++ unordered_map check if key exists
C++
0 vote295 views1 answer
Shell-Sort C++
C++
1 vote270 views1 answer
Lower bound c++
C++
0 vote257 views1 answer
Javascript if else exercises
C++
3 votes269 views1 answer
Function in struct c++
C++
1 vote281 views1 answer
Doubly linked list c++ code
C++
0 vote283 views1 answer
How to calculate bitwise xor c++
C++
3 votes256 views2 answers
C++ get data type
C++