bubble sort c++ with return code example

Example 1: bubble sort in c++

void bubble_sort( int A[ ], int n ) {
    int temp;
    for(int k = 0; k< n-1; k++) {
        // (n-k-1) is for ignoring comparisons of elements which have already been compared in earlier iterations

        for(int i = 0; i < n-k-1; i++) {
            if(A[ i ] > A[ i+1] ) {
                // here swapping of positions is being done.
                temp = A[ i ];
                A[ i ] = A[ i+1 ];
                A[ i + 1] = temp;
            }
        }
    }
}

Example 2: code for bubble sort in c++

void bubbleSort (int S[ ],  int length) {
	bool isSorted = false;
	while(!isSorted)
   	{
		isSorted = true;
		for(int i = 0; i<length; i++)
      	{
		     if(S[i] > S[i+1])
           	     {
			int temp = S[i];
			S[i] = S[i+1];
     	       		S[i+1] = temp;
            		isSorted = false;
           	      }
      	}
      	length--;
}
}