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 vote130 views1 answer
How to point to next array using pointer c++
C++
0 vote157 views1 answer
Const char * to std::wstring
C++
0 vote141 views1 answer
Cpp language explained
C++
5 votes120 views4 answers
Split pdf
C++
0 vote123 views1 answer
The smallest element from three
C++
7 votes114 views2 answers
System cls c
C++
0 vote114 views1 answer
C++ print number not in scientific notation
C++
2 votes126 views1 answer
Dangling Pointer
C++
0 vote127 views1 answer
Mac emoji shortcut
C++
1 vote118 views1 answer
Concurrency in c++
C++