Calculates the maximum K value of an integer array by bubble sort.

Let's take a look at the best method. This is only improved using the Bubble sorting method.

 

# Include <iostream>
Using namespace STD;

// Calculate the maximum K value
// The idea is to use the Bubble sorting method. A major drawback is that it changes the order of the original array.
Int querykmax (int A [], int Len, int K)
{
Int COUNT = 0;
Int temp = 0;
Bool endcir = true;

For (INT I = 0; (I <Len) & (count <= k) & endcir; I ++)
{
Endcir = false;
For (Int J = 0; j <len-I; j ++)
{
If (A [J]> A [J + 1])
{
Temp = A [J];
A [J] = A [J + 1];
A [J + 1] = temp;
Endcir = true;
}

}
Count ++;
}

Return a [Len-count + 1];
}

Void main ()
{
Int arr [10] = };

Int Len = 10;
Int K = 4;

Cout <"The K max value is" <querykmax (ARR, Len, k) <Endl;

For (INT I = 0; I <Len; I ++)
{
Cout <arr [I] <"";
}

}