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 vote198 views6 answers
Iterator on std::tuple
C++
0 vote291 views1 answer
Prisma client
C++
0 vote183 views1 answer
Parenthesis Checker using stack in c++
C++
1 vote221 views1 answer
C++ function parameters
C++
0 vote240 views1 answer
Short int range in c++
C++
1 vote191 views1 answer
Qtextedit no line break
C++
1 vote212 views2 answers
Struct constructor in c++
C++
2 votes177 views1 answer
Unordered_map of pair and int
C++
10 votes211 views3 answers
Conditional operator in c++
C++
5 votes198 views6 answers
Binary search algorithm
C++