concern to shaker sort arlgorithm

[Member_15233409]

I am currently taking a exercise is the shaker sort algorithm.Instead of separating two for loops, I have included a for-j loop inside a for-i loop. Please check my code.

public static void shakerSort(int array[], int n)
{
boolean swapped = true;
while (swapped)
{
swapped = false;
for (int i = 0; i < n - 1; i++)
{
if (array[i] > array[i + 1])
{
int temp = array[i];
array[i] = array[i + 1];
array[i + 1] = temp;
swapped = true;
}

         if (i == n - 2) 
         {
             if (!swappped)
             {
                break;
             }
             else
             {
                 swapped = false;
                 for (int j = n - 1; j > 0; j--) 
                 {
                      if (array\[j - 1\] > array\[j\]) 
                      {
                           int temp = array\[j\];
                           array\[j\] = array\[j - 1\];
                           array\[j - 1\] = temp;
                           swapped = true;
                      }
                 }
                 if (!swapped) 
                 {
                   break;
                 }
             }     
         }
    }
}

Output:

-5
-3
5
9
11
12
15
18

I hope you can rate my code .Thank you very much

[Richard Andrew x64]

Member 15233409 wrote:

I hope you can rate my code .

I give your code a 4.5 rating. You're welcome.

The difficult we do right away... ...the impossible takes slightly longer.